|
|
A054244
|
|
Number of partitions of n into distinct positive parts <= n, with parts combined by IOR (inclusive or).
|
|
2
|
|
|
1, 1, 5, 1, 5, 5, 109, 1, 5, 5, 109, 5, 109, 109, 32297, 1, 5, 5, 109, 5, 109, 109, 32297, 5, 109, 109, 32297, 109, 32297, 32297, 2147321017, 1, 5, 5, 109, 5, 109, 109, 32297, 5, 109, 109, 32297, 109, 32297, 32297, 2147321017, 5, 109, 109, 32297, 109, 32297
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,3
|
|
LINKS
|
D. Applegate, M. LeBrun, N. J. A. Sloane, Dismal Arithmetic, J. Int. Seq. 14 (2011) # 11.9.8.
|
|
FORMULA
|
|
|
EXAMPLE
|
a(3)=5 thus: 3 3+2 3+1 3+2+1 2+1 (with "+" meaning IOR).
|
|
MATHEMATICA
|
A003465[n_] := Sum[(-1)^k*Binomial[n, k]*2^(2^(n - k)), {k, 0, n}]/2; a[n_] := A003465[DigitCount[n, 2, 1]]; Table[a[n], {n, 1, 53}] (* Jean-François Alcover, Nov 21 2012, from formula *)
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn,nice
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|