|
Search: id:A096276
|
|
|
| A096276 |
|
Number of partitions of n with a product <=n. |
|
+0
2
|
|
| 0, 1, 2, 3, 5, 6, 8, 9, 12, 14, 16, 17, 21, 22, 24, 26, 31, 32, 36, 37, 41, 43, 45, 46, 53, 55, 57, 60, 64, 65, 70, 71, 78, 80, 82, 84, 93, 94, 96, 98, 105, 106, 111, 112, 116, 120, 122, 123, 135, 137, 141, 143, 147, 148, 155, 157, 164, 166, 168, 169, 180, 181, 183, 187
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
a(n)=a(n-1)+1 iff n is prime
|
|
FORMULA
|
Partial sums of A001055. - Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 24 2004
|
|
EXAMPLE
|
a(6)=8 as we can have 6,51,411,321,3111,2211,21111,111111, rejecting 42,33 and 222.
|
|
PROGRAM
|
(PARI) { bla(n, m, v, z)=v=concat(v, m); if(!n, x=prod(k=1, length(v), v[k]); if (x<=z, c++), for(i=1, min(m, n), bla(n-i, i, v, z))); } partitions(n)=c=0; for(i=1, n, bla(n-i, i, [], n)); print1(", "c); for(i=0, 40, q(i))
|
|
CROSSREFS
|
Sequence in context: A136112 A135768 A127936 this_sequence A075725 A049407 A030759
Adjacent sequences: A096273 A096274 A096275 this_sequence A096277 A096278 A096279
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Jon Perry (perry(AT)globalnet.co.uk), Jun 23 2004
|
|
EXTENSIONS
|
More terms from Vladeta Jovovic (vladeta(AT)Eunet.yu), Jun 24 2004
|
|
|
Search completed in 0.002 seconds
|
