Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A122478
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A122478 Minimum number k>0 such that ((2n+1)^k - (2n-1)^k)/2 is prime. +0
1
3, 13, 3, 3, 5, 3, 17, 3, 163, 3, 3, 109, 3, 13, 19, 5, 3, 3, 1879, 3, 13, 379, 7, 1531, 7, 5, 337, 5, 3, 61, 19, 3, 23, 3, 11 (list; graph; listen)
OFFSET

1,1

COMMENT

All a(n) are primes. Corresponding minimal primes of the form ((2n+1)^k - (2n-1)^k)/2 are {13, 609554401, 109, 193, 51001, 433, 44937854708156010721, 769, ...}.

a(37)-a(44) are 163, 23, 3, 5, 3, 3, 3, 5. a(46)-a(49) are 17, 5, 31, 3. a(51)-a(61) are 109, 5, 7, 89, 13, 3, 31, 53, 5, 3, 5. a(63)-a(69) are 3, 7, 19, 5, 167, 163, 293. a(71)-a(74) are 3, 3407, 3, 3. a(76)-a(77) are 3, 19. a(36), a(45), a(50), a(62), a(70), a(75) are currently unknown.

CROSSREFS

Cf. A028491, A121877.

Sequence in context: A068697 A010258 A107774 this_sequence A128368 A050089 A125571

Adjacent sequences: A122475 A122476 A122477 this_sequence A122479 A122480 A122481

KEYWORD

hard,more,nonn

AUTHOR

Alexander Adamchuk (alex(AT)kolmogorov.com), Sep 14 2006, Sep 17 2006, Oct 07 2006

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research