id:A086599 - OEIS Search Results

Search: id:A086599

Displaying 1-1 of 1 results found.

page 1

Number of prime factors in Lucas(n), counting multiplicity.

+0
3

0, 1, 2, 1, 1, 3, 1, 1, 3, 2, 1, 3, 1, 2, 4, 1, 1, 5, 1, 2, 4, 3, 2, 3, 3, 2, 4, 3, 2, 5, 1, 2, 4, 3, 4, 4, 1, 2, 5, 3, 1, 6, 2, 4, 7, 3, 1, 4, 2, 4, 5, 3, 1, 7, 5, 2, 5, 3, 3, 6, 1, 2, 7, 2, 5, 6, 2, 2, 6, 4, 1, 4, 2, 3, 8, 2, 4, 5, 1, 2, 6, 4, 2, 7, 4, 2, 6, 3, 2, 8, 3, 3, 5, 4, 5, 4, 2, 4, 8, 4, 3, 7, 3, 4, 10 (list; graph; listen)

	OFFSET	`1,3`
	LINKS	`Blair Kelly, Fibonacci and Lucas Factorizations` `Eric Weisstein's World of Mathematics, Lucas Number`
	MATHEMATICA	`Lucas[n_] := Fibonacci[n+1] + Fibonacci[n-1]; Join[{0}, Table[Plus@@(Transpose[FactorInteger[Lucas[n]]][[2]]), {n, 2, 150}]]`
	CROSSREFS	`Cf. A000204 (Lucas numbers), A086598 (number of distinct prime factors), A086600 (number of primitive prime factors).` `Adjacent sequences: A086596 A086597 A086598 this_sequence A086600 A086601 A086602` `Sequence in context: A117502 A030360 A095374 this_sequence A030272 A057898 A094293`
	KEYWORD	`hard,nonn`
	AUTHOR	`T. D. Noe (noe(AT)sspectra.com), Jul 24 2003`

page 1

Search completed in 0.002 seconds

Last modified October 12 12:59 EDT 2008. Contains 144830 sequences.

AT&T Labs Research