Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A137666
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A137666 Largest prime factor of A137664(n) = (p + 1)^p - 1 for p = prime[n]. +0
3
2, 7, 311, 337, 266981089, 29914249171, 7563707819165039903, 192696104561, 58769065453824529, 847499019384726257346113954958447091, 18158209813151, 138233050898929517126243814850350442620694127 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) is also largest prime factor of A137665(n) = A137664(n)/Prime(n)^2. p^2 divides A137664(n) = (p + 1)^p - 1, p = Prime[n]. Least prime factors of A137664(n) are listed in A128456(n) = {2,7,311,127,23,157,7563707819165039903,...}. a(n) = A128456(n) = A137665(n) = ((p + 1)^p - 1)/p^2 for n = {1,2,3,7,595,...} corresponding to p = Prime(n) = {2,3,5,17,4357,...} = A127837. a(14) = 7830258625438900077912088739. a(16) = 624260614519341189444454570737302439190642520992875859393.

CROSSREFS

Cf. A128452, A128456, A128356, A128357, A137664, A137665, A128466, A127837.

Sequence in context: A013097 A012987 A128456 this_sequence A137665 A128466 A048122

Adjacent sequences: A137663 A137664 A137665 this_sequence A137667 A137668 A137669

KEYWORD

hard,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Feb 04 2008

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 December 8 08:31 EST 2009. Contains 170430 sequences.


AT&T Labs Research