|
Search: id:A106595
|
|
| |
|
| 1, 1, 1, 2, 3, 3, 1, 2, 5, 9, 12, 12, 1, 2, 5, 13, 26, 41, 53, 53, 1, 2, 5, 13, 34, 73, 129, 194, 247, 247, 1, 2, 5, 13, 34, 89, 201, 386, 645, 945, 1192, 1192, 1, 2, 5, 13, 34, 89, 233, 546, 1117, 2021, 3266, 4705, 5897, 5897
(list; graph; listen)
|
|
|
OFFSET
|
0,4
|
|
|
EXAMPLE
|
1,1; 1,2,3,3; 1,2,5,9,12,12; 1,2,5,13,26,41,53,53; ...
|
|
MAPLE
|
A106580 := proc(n, k) option remember ; if k =0 then 1 ; else A106580(n, k-1)+add(A106580(n-2*i, k-i), i=1..min(k, floor(n/2), n-k)) ; fi ; end: for n from 1 to 13 by 2 do for k from 0 to n do printf("%d, ", A106580(n, k)) ; od ; od ; - R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 02 2007
|
|
CROSSREFS
|
Cf. A106580, A106585.
Sequence in context: A108132 A106589 A051911 this_sequence A109199 A087074 A136453
Adjacent sequences: A106592 A106593 A106594 this_sequence A106596 A106597 A106598
|
|
KEYWORD
|
nonn,tabf,easy
|
|
AUTHOR
|
N. J. A. Sloane (njas(AT)research.att.com), May 30 2005
|
|
EXTENSIONS
|
More terms from R. J. Mathar (mathar(AT)strw.leidenuniv.nl), May 02 2007
|
|
|
Search completed in 0.002 seconds
|
