Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A023395
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A023395 Only Fermat number divisible by A023394(n) is 2^2^a(n) + 1. +0
2
0, 1, 2, 3, 5, 4, 12, 6, 11, 11, 9, 5, 18, 12, 10, 12, 23, 16, 15, 10, 19, 12, 19, 13, 36, 21, 38, 32, 25, 17, 39, 6, 26, 27, 30, 30, 8, 12, 15, 29, 38, 7, 25, 27 (list; graph; listen)
OFFSET

1,3

LINKS

Wilfrid Keller, Prime factors k.2^n + 1 of Fermat numbers F_m

CROSSREFS

Sequence in context: A112060 A084933 A138153 this_sequence A101409 A131401 A061446

Adjacent sequences: A023392 A023393 A023394 this_sequence A023396 A023397 A023398

KEYWORD

nonn

AUTHOR

David W. Wilson (davidwwilson(AT)comcast.net)

EXTENSIONS

a(25)-a(41) computed using data from Wilfrid Keller -- T. D. Noe (noe(AT)sspectra.com), Feb 01 2009

Three more terms -- T. D. Noe (noe(AT)sspectra.com), Feb 03 2009

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 November 24 23:16 EST 2009. Contains 167481 sequences.


AT&T Labs Research