Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A066877
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A066877 a(n) = omega(n!-1), where omega is the number of distinct primes dividing n, A001221. +0
2
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; listen)
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 this_sequence A029255 A029272 A153904

Adjacent sequences: A066874 A066875 A066876 this_sequence A066878 A066879 A066880

KEYWORD

hard,nonn

AUTHOR

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

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 December 9 18:50 EST 2009. Contains 170568 sequences.

AT&T Labs Research

Legal Notice
© 2009 AT&T Intellectual Property. All Rights Reserved.