Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A116087
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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; listen)
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

PROGRAM

(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: A082666 A057938 A048619 this_sequence A116921 A093068 A097357

Adjacent sequences: A116084 A116085 A116086 this_sequence 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

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 November 18 20:14 EST 2008. Contains 147244 sequences.


AT&T Labs Research