OFFSET
0,5
COMMENTS
Diagonal sums of A103631.
The Kn11 sums, see A180662, of triangle A065941 equal the terms of this sequence without a(0) and a(1). - Johannes W. Meijer, Aug 11 2011
For n >= 2, a(n) is the number of palindromic compositions of n-2 with parts in {2,1,3,5,7,9,...}. The generating function follows easily from Theorem 1,2 of the Hoggatt et al. reference. Example: a(9) = 8 because we have 7, 151, 11311, 232, 313, 12121, 21112, and 1111111. - Emeric Deutsch, Aug 17 2016
Essentially the same as A003411. - Georg Fischer, Oct 07 2018
LINKS
Muniru A Asiru, Table of n, a(n) for n = 0..1000
V. E. Hoggatt, Jr., and Marjorie Bicknell, Palindromic compositions, Fibonacci Quart., Vol. 13(4), 1975, pp. 350-356.
Index entries for linear recurrences with constant coefficients, signature (1,0,0,1).
FORMULA
MAPLE
A103632 := proc(n): add( binomial(floor((2*n-3*k-1)/2), n-2*k), k=0..floor(n/2)) end: seq(A103632(n), n=0..46); # Johannes W. Meijer, Aug 11 2011
MATHEMATICA
LinearRecurrence[{1, 0, 0, 1}, {1, 0, 1, 1}, 50] (* G. C. Greubel, Mar 10 2019 *)
PROG
(GAP) a:=[1, 0, 1, 1];; for n in [5..50] do a[n]:=a[n-1]+a[n-4]; od; a; # Muniru A Asiru, Oct 07 2018
(PARI) my(x='x+O('x^50)); Vec((1-x+x^2)/(1-x-x^4)) \\ G. C. Greubel, Mar 10 2019
(Magma) I:=[1, 0, 1, 1]; [n le 4 select I[n] else Self(n-1) + Self(n-4): n in [1..50]]; // G. C. Greubel, Mar 10 2019
(Sage) ((1-x+x^2)/(1-x-x^4)).series(x, 50).coefficients(x, sparse=False) # G. C. Greubel, Mar 10 2019
CROSSREFS
KEYWORD
easy,nonn
AUTHOR
Paul Barry, Feb 11 2005
EXTENSIONS
Formula corrected by Johannes W. Meijer, Aug 11 2011
STATUS
approved