|
Search: id:A091336
|
|
| |
|
| 0, 1, 2, 3, 4, 6, 7, 11, 15, 18, 23, 27
(list; graph; listen)
|
|
|
OFFSET
|
0,3
|
|
|
COMMENT
|
All numbers less than 2.5*10^15 in Sylvester's sequence are squarefree and no squareful numbers in this sequence are known (Vardi 1991).
|
|
REFERENCES
|
Vardi, I. "Are All Euclid Numbers Squarefree?" and "PowerMod to the Rescue." Sections 5.1 and 5.2 in Computational Recreations in Mathematica. Reading, MA: Addison-Wesley, pp. 82-89, 1991.
|
|
LINKS
|
Eric Weisstein's World of Mathematics, Sylvester's sequence
|
|
FORMULA
|
a(n) = A001221(A000058(n)-1) = A001221(A000058(0)*...*A000058(n-1)) = Sum(A091335(i), i=0..n-1)
|
|
CROSSREFS
|
Cf. A000058, A091335.
Sequence in context: A113243 A130690 A074885 this_sequence A002235 A030705 A057128
Adjacent sequences: A091333 A091334 A091335 this_sequence A091337 A091338 A091339
|
|
KEYWORD
|
hard,nonn
|
|
AUTHOR
|
Max Alekseyev (maxale(AT)gmail.com), Dec 30 2003
|
|
EXTENSIONS
|
One more term from Max Alekseyev (maxale(AT)gmail.com), Sep 11 2006
|
|
|
Search completed in 0.002 seconds
|
