Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A128456
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A128456 Quotients A128452(p+1)/p for prime p = prime[n]. +0
8
2, 7, 311, 127, 23, 157, 7563707819165039903, 75368484119, 47, 9629, 311, 25679, 821 (list; graph; listen)
OFFSET

1,1

COMMENT

a(n) coincides with A128357(n) from n = 2 up to n = 6.

FORMULA

a(n) = A128452(prime(n)+1)/prime(n).

CROSSREFS

Cf. A128452 = least number k>n such that k^2 divides n^k - 1, A128357, A128356 = least number k>1 (that is not the power of prime p) such that k divides (p+1)^k-1, where p = prime[n]. Cf. A127103, A127104, A127105, A127106, A127107, A127102, A127101, A127100, A127092, A128393, A128394, A128395, A128396, A128397, A128398, A128399, A128400, A128401, A128402, A128403, A128404.

Sequence in context: A013058 A013097 A012987 this_sequence A137666 A137665 A128466

Adjacent sequences: A128453 A128454 A128455 this_sequence A128457 A128458 A128459

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Mar 05 2007, Mar 09 2007

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 10 12:37 EST 2009. Contains 170569 sequences.


AT&T Labs Research