Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A027760
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A027760 Denominator of Sum 1/p; p-1 | n. +0
13
2, 6, 2, 30, 2, 42, 2, 30, 2, 66, 2, 2730, 2, 6, 2, 510, 2, 798, 2, 330, 2, 138, 2, 2730, 2, 6, 2, 870, 2, 14322, 2, 510, 2, 6, 2, 1919190, 2, 6, 2, 13530, 2, 1806, 2, 690, 2, 282, 2, 46410, 2, 66, 2, 1590, 2, 798, 2, 870 (list; graph; listen)
OFFSET

1,1

COMMENT

The gcd of integers x^(n+1)-x, for all integers x. - Roger Cuculiere (cuculier(AT)imaginet.fr), Jan 19 2002

REFERENCES

S. C. Locke and A. Mandel, Problem E 2901, American Mathematical Monthly 88 (1981), p. 538. Solution in Vol. 90 (1983), pp. 212-213. [From Daniel M. Rosenblum (DMRosenblum(AT)world.oberlin.edu), Jul 31 2008]

MAPLE

A027760 := proc(n) local s, p; s := 0 ; p := 2; while p <= n+1 do if n mod (p-1) = 0 then s := s+1/p; fi; p := nextprime(p) ; od: denom(s) ; end: [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 12 2008]

CROSSREFS

Cf. A027759.

Sequence in context: A125032 A131980 A076743 this_sequence A122018 A005729 A086660

Adjacent sequences: A027757 A027758 A027759 this_sequence A027761 A027762 A027763

KEYWORD

nonn,frac

AUTHOR

njas

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified September 6 16:04 EDT 2008. Contains 143483 sequences.


AT&T Labs Research