The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A233324 Triangle read by rows: T(n,k) = number of palindromic compositions of n in which no part exceeds k, 1 <= k <= n. 4
1, 1, 2, 1, 1, 2, 1, 3, 3, 4, 1, 2, 3, 3, 4, 1, 5, 6, 7, 7, 8, 1, 3, 6, 6, 7, 7, 8, 1, 8, 11, 14, 14, 15, 15, 16, 1, 5, 11, 12, 14, 14, 15, 15, 16, 1, 13, 20, 27, 28, 30, 30, 31, 31, 32, 1, 8, 20, 23, 28, 28, 30, 30, 31, 31, 32, 1, 21, 37, 52, 55, 60, 60, 62, 62, 63, 63, 64 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,3
COMMENTS
A palindromic composition of a natural number m is an ordered partition of m into N+1 natural numbers (or parts), p_0, p_1, ..., p_N, of the form m = p_0 + p_1 + ... + p_N such that p_j = p_{N-j}, for each j in {0,...,N}. Two palindromic compositions, sum_{j=0..N} p_j and sum_{j=0..N} q_j (say), are identical if and only if p_j = q_j, j = 0,...,N; otherwise they are taken to be distinct.
Partial sums of rows of A233323.
T(n,k) is defined for n,k >= 0. T(n,k) = T(n,n) = A016116(n) for k>= 0. - Alois P. Heinz, Dec 11 2013
LINKS
V. E. Hoggatt, Jr., and Marjorie Bicknell, Palindromic compositions, Fibonacci Quart., Vol. 13(4), 1975, pp. 350-356.
EXAMPLE
Triangle T(n,k) begins:
1;
1, 2;
1, 1, 2;
1, 3, 3, 4;
1, 2, 3, 3, 4;
1, 5, 6, 7, 7, 8;
1, 3, 6, 6, 7, 7, 8;
1, 8, 11, 14, 14, 15, 15, 16;
1, 5, 11, 12, 14, 14, 15, 15, 16;
1, 13, 20, 27, 28, 30, 30, 31, 31, 32;
MAPLE
T:= proc(n, k) option remember; `if`(n<=k, 1, 0)+
add(T(n-2*j, k), j=1..min(k, iquo(n, 2)))
end:
seq(seq(T(n, k), k=1..n), n=1..14); # Alois P. Heinz, Dec 11 2013
MATHEMATICA
T[n_, k_] := T[n, k] = If[n <= k, 1, 0] + Sum[T[n-2*j, k], {j, 1, Min[k, Quotient[ n, 2]]}]; Table[Table[T[n, k], {k, 1, n}], {n, 1, 14}] // Flatten (* Jean-François Alcover, Mar 09 2015, after Alois P. Heinz *)
PROG
(PARI) T(n, k)=if(n<1, return(n==0)); sum(i=1, k, T(n-2*i, k))+(n<=k) \\ Charles R Greathouse IV, Dec 11 2013
CROSSREFS
Cf. A233323.
T(n,2) = A053602(n+1) = A123231(n). T(2n,3) = A001590(n+3). T(2n,4) = A001631(n+4). - Alois P. Heinz, Dec 11 2013
Sequence in context: A076302 A104524 A233322 * A268679 A128807 A309035
KEYWORD
nonn,tabl
AUTHOR
L. Edson Jeffery, Dec 11 2013
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 17 15:39 EDT 2024. Contains 372603 sequences. (Running on oeis4.)