Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A134852
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A134852 Number of distinct prime factors of the Fibonacci numbers in A050937. +0
19
0, 2, 2, 3, 2, 2, 2, 2, 3, 2, 2, 2, 2, 4, 2, 3, 2, 2, 2, 2, 3, 4, 2, 4, 4, 2, 2, 3, 3, 2, 2, 4, 2, 4, 4, 2, 5 (list; graph; listen)
OFFSET

1,2

FORMULA

a(n)=A001221(A050937(n)). - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 03 2008

MATHEMATICA

a = {}; k = {}; Do[If[ ! PrimeQ[Fibonacci[Prime[n]]], c = Length[FactorInteger[Fibonacci[Prime[n]]]]; AppendTo[k, c]], {n, 1, 50}]; k ( * Artur Jasinski *)

CROSSREFS

Cf. A000045, A001605, A050937, A075737, A090819, A134787, A134851.

Adjacent sequences: A134849 A134850 A134851 this_sequence A134853 A134854 A134855

Sequence in context: A145989 A117183 A071187 this_sequence A071188 A152235 A123582

KEYWORD

nonn

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Nov 13 2007

EXTENSIONS

Edited by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 03 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 January 8 02:43 EST 2009. Contains 152824 sequences.


AT&T Labs Research