The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A101693 A modular binomial sum transform of 2^n. 1
 1, 1, 5, 1, 21, 1, 5, 17, 341, 1, 5, 17, 85, 257, 1285, 4369, 87381, 1, 5, 17, 85, 257, 1285, 4369, 21845, 65537, 327685, 1114129, 5570645, 16843009, 84215045, 286331153, 5726623061, 1, 5, 17, 85, 257, 1285, 4369, 21845, 65537, 327685, 1114129, 5570645 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,3 COMMENTS a(2^n)=A101694(n); b(2^n+1) is 5,1,1,1,.... LINKS FORMULA a(n)=sum{k=0..n, mod(binomial(2n-2, k), 2)2^k} MATHEMATICA Table[Sum[Mod[Binomial[2n-2, k], 2]2^k, {k, 0, n}], {n, 0, 50}] (* Harvey P. Dale, Nov 23 2019 *) CROSSREFS Cf. A001045. Sequence in context: A049411 A070729 A296306 * A063476 A126325 A278544 Adjacent sequences:  A101690 A101691 A101692 * A101694 A101695 A101696 KEYWORD easy,nonn AUTHOR Paul Barry, Dec 11 2004 STATUS approved

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

Last modified September 21 20:10 EDT 2021. Contains 347598 sequences. (Running on oeis4.)