The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 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 (list; graph; refs; listen; history; text; internal format)
 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 Gheorghe Coserea, Table of n, a(n) for n = 0..200 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 Adjacent sequences:  A274177 A274178 A274179 * A274181 A274182 A274183 KEYWORD nonn,base AUTHOR Gheorghe Coserea, Jun 12 2016 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.

Last modified May 24 05:06 EDT 2022. Contains 354005 sequences. (Running on oeis4.)