|
Search: id:A116370
|
|
|
| A116370 |
|
Number of distinct prime factors of P(L(n)) where L(n) is the Lucas number and P(n) is the unrestricted partition number. |
|
+0
1
|
|
| 1, 1, 2, 2, 3, 3, 4, 2, 2, 3, 4, 5, 4, 4, 5, 5, 8, 10, 6, 7
(list; graph; listen)
|
|
|
OFFSET
|
2,3
|
|
|
EXAMPLE
|
P(L(14)) = 37285884524590579748861394570 = 2 * 3^2 * 5 * 414287605828784219431793273, so the 13th number in the sequence is 4.
|
|
MAPLE
|
A000041 := proc(n) combinat[numbpart](n) ; end: A000204 := proc(n) option remember ; if n = 1 then 1; elif n = 2 then 3 ; else A000204(n-1)+A000204(n-2) ; fi ; end: A116370 := proc(n) local fcts ; fcts := A000041(A000204(n)) ; nops(numtheory[factorset](fcts)) ; end: for n from 2 to 20 do print(A116370(n)) ; od: - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008
|
|
CROSSREFS
|
Adjacent sequences: A116367 A116368 A116369 this_sequence A116371 A116372 A116373
Sequence in context: A071505 A071508 A085561 this_sequence A106486 A106494 A015135
|
|
KEYWORD
|
more,nonn
|
|
AUTHOR
|
Parthasarathy Nambi (PachaNambi(AT)yahoo.com), Mar 15 2006
|
|
EXTENSIONS
|
2 more terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Jan 30 2008
a(17)-a(21) from Donovan Johnson (donovan.johnson(AT)yahoo.com), Aug 31 2008
|
|
|
Search completed in 0.002 seconds
|
