|
|
A258073
|
|
a(n) = 1 + 78557*2^n.
|
|
4
|
|
|
157115, 314229, 628457, 1256913, 2513825, 5027649, 10055297, 20110593, 40221185, 80442369, 160884737, 321769473, 643538945, 1287077889, 2574155777, 5148311553, 10296623105, 20593246209, 41186492417, 82372984833, 164745969665, 329491939329
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,1
|
|
COMMENTS
|
78557 is the (conjectured) smallest Sierpiński number (A076336). This means that every number in the current sequence is composite.
Every number in the sequence is divisible by some number in {3, 5, 7, 13, 19, 37, 73}.
|
|
LINKS
|
|
|
FORMULA
|
|
|
MATHEMATICA
|
|
|
PROG
|
(Sage) [78557*2^n+1 for n in [1..25]]
(Haskell)
|
|
CROSSREFS
|
Cf. A258091 (smallest prime factors).
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|