login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A274180
a(n) = Sum_{k=0..4n} (A035343(n,k) mod 2) * 2^k.
1
1, 31, 341, 6483, 69905, 2027247, 21041413, 417263459, 4311810305, 133666119455, 1461703693397, 27806864656979, 299071474565137, 8708265758097903, 90161415181374469, 1785159701350222947, 18447025552981295105
OFFSET
0,2
COMMENTS
a(n) is a binary palindrome (A006995) of 4n+1 bits since A035343(n,k) = A035343(n,4n-k), k=0..4n and A035343(n,0) = A035343(n,4n) = 1.
LINKS
PROG
(PARI)
a(n) = subst(lift(Pol(Mod([1, 1, 1, 1, 1], 2), 'x)^n), 'x, 2);
vector(17, n, a(n-1))
CROSSREFS
Cf. A035343.
Sequence in context: A100728 A332945 A296730 * A197644 A295211 A261759
KEYWORD
nonn,base
AUTHOR
Gheorghe Coserea, Jun 12 2016
STATUS
approved