[go: nahoru, domu]

login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A091336 Number of prime divisors of A000058(n)-1 = A000058(0)*...*A000058(n-1). 3
0, 1, 2, 3, 4, 6, 7, 11, 15, 18, 23, 27 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
COMMENTS
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_{i=0..(n-1)} A091335(i).
MATHEMATICA
PrimeNu[NestList[#^2 - # + 1 &, 2, 10] - 1] (* G. C. Greubel, May 09 2017 *)
CROSSREFS
Sequence in context: A074885 A215231 A301512 * A002235 A217132 A239014
KEYWORD
hard,more,nonn
AUTHOR
Max Alekseyev, Dec 30 2003
EXTENSIONS
One more term from Max Alekseyev, Sep 11 2006
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 8 08:07 EDT 2024. Contains 375751 sequences. (Running on oeis4.)