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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A116087 Number of distinct prime factors of P(F(n)) where F(n) is the Fibonacci number and P(n) is the unrestricted partition number. 1
0, 0, 0, 1, 1, 1, 2, 1, 3, 3, 4, 3, 3, 4, 3, 4, 4, 3, 8, 5, 7, 8 (list; graph; refs; listen; history; internal format)
OFFSET

0,7

EXAMPLE

a(14)=3 because F(14)=377 and P(377)=2389 x 16197169 x 41263051.

MAPLE

with(combinat): with(numtheory): a:=n->nops(factorset(numbpart(fibonacci(n)))): seq(a(n), n=0..18); - Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 26 2006

PROG

(PARI) A116087(n)={ omega(numbpart(fibonacci(n))) ; } { for(n=0, 80, print(A116087(n)) ; ) ; } - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 26 2008

CROSSREFS

Sequence in context: A057938 A144623 A048619 * A163281 A116921 A173989

Adjacent sequences:  A116084 A116085 A116086 * A116088 A116089 A116090

KEYWORD

more,nonn

AUTHOR

Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Mar 15 2006

EXTENSIONS

More terms from Emeric Deutsch (deutsch(AT)duke.poly.edu), Jul 26 2006

More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 26 2008

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 15 10:28 EST 2012. Contains 205763 sequences.