cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A274180 a(n) = Sum_{k=0..4n} (A035343(n,k) mod 2) * 2^k.

Original entry on oeis.org

1, 31, 341, 6483, 69905, 2027247, 21041413, 417263459, 4311810305, 133666119455, 1461703693397, 27806864656979, 299071474565137, 8708265758097903, 90161415181374469, 1785159701350222947, 18447025552981295105
Offset: 0

Views

Author

Gheorghe Coserea, Jun 12 2016

Keywords

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.

Crossrefs

Cf. A035343.

Programs

  • PARI
    a(n) =  subst(lift(Pol(Mod([1, 1, 1, 1, 1], 2), 'x)^n), 'x, 2);
    vector(17,n,a(n-1))