Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A113933
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A113933 (F5,F7,F8,F9,F10,F11,F12,F14) - 10^n = prime where F stands for the Fermat numbers 2^2^x + 1 where x corresponds to 5,7,8,9,10,11,12 and 14. +0
1
2, 16, 28, 6, 30, 72, 130, 255 (list; graph; listen)
OFFSET

2,1

COMMENT

This sequence shows that the difference between a composite number and a prime rests on the modification of a single decimal digit. Note that F6 and F13 regarding the Fermat numbers are exceptions to this rule.

EXAMPLE

F5 - 10^2 = 4294967197 = prime

MATHEMATICA

Position[PrimeQ[Table[2^2^5 + 1 - 10^n, {n, 10}]], True]

CROSSREFS

Sequence in context: A067566 A067555 A108705 this_sequence A127871 A109210 A056707

Adjacent sequences: A113930 A113931 A113932 this_sequence A113934 A113935 A113936

KEYWORD

nonn

AUTHOR

Joao Carlos Leandro da Silva (zxawyh66(AT)yahoo.com), Jan 30 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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research