login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066877 a(n) = omega(n!-1), where omega is the number of distinct primes dividing n, A001221. 1
0, 0, 1, 1, 2, 1, 1, 2, 2, 2, 4, 1, 2, 1, 4, 2, 3, 3, 3, 2, 4, 3, 2, 2, 3, 2, 2, 4, 5, 1, 3, 1, 1, 2, 3, 2, 5, 1, 4, 2, 4, 4, 7, 4, 5, 5, 2, 4, 3, 2, 5, 6, 4, 6, 6, 5, 6, 5, 2, 3 (list; graph; refs; listen; history; internal format)
OFFSET

1,5

LINKS

Hisanori Mishima, Appendix 1. Factorization results for n!-1

MATHEMATICA

Table[ Length[ FactorInteger[ n! - 1]], {n, 1, 30}]

CROSSREFS

Sequence in context: A145788 A117592 A117942 * A029255 A029272 A153904

Adjacent sequences:  A066874 A066875 A066876 * A066878 A066879 A066880

KEYWORD

hard,nonn

AUTHOR

Robert G. Wilson v (rgwv(AT)rgwv.com), Jan 21 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 19:13 EST 2012. Contains 206085 sequences.