|
| |
|
|
A096276
|
|
Number of partitions of n with a product <=n.
|
|
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; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 0,3
|
|
|
COMMENTS
| For n>1, a(n)=a(n-1)+1 iff n is prime
|
|
|
LINKS
| T. D. Noe, Table of n, a(n) for n = 0..1000
|
|
|
FORMULA
| Partial sums of A001055. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 24 2004
|
|
|
EXAMPLE
| a(6)=8 as we can have 6, 51, 411, 321, 3111, 2211, 21111, 111111, rejecting 42, 33 and 222.
|
|
|
MATHEMATICA
| c[1, r_] := c[1, r] = 1; c[n_, r_] := c[n, r] = Module[{ds, i}, ds = Select[Divisors[n], 1 < # <= r &]; Sum[c[n/ds[[i]], ds[[i]]], {i, 1, Length[ds]}]]; a[n_] := c[n, n]; Join[{0}, Accumulate[Array[a, 100]]] (* using program from A001055, T. D. Noe, Apr 11 2011 *)
|
|
|
PROG
| (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: A000534 A136112 A127936 * A075725 A049407 A030759
Adjacent sequences: A096273 A096274 A096275 * 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.rs), Jun 24 2004
|
| |
|
|
