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!)
 A100746 Inverse modulo 2 binomial transform of Jacobsthal numbers J(n). 0
 0, 1, 1, 1, 5, 5, 15, 15, 85, 85, 255, 255, 1275, 1275, 3825, 3825, 21845, 21845, 65535, 65535, 327675, 327675, 983025, 983025, 5570475, 5570475, 16711425, 16711425, 83557125, 83557125, 250671375, 250671375, 1431655765, 1431655765, 4294967295 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,5 COMMENTS J(n) may be retrieved as sum{k=0..n, mod(binomial(n,k),2)*a(k)}. LINKS FORMULA a(n)=sum{k=0..n, (-1)^A010060(n-k)*mod(binomial(n, k), 2)J(n)}. CROSSREFS Cf. A001045. Sequence in context: A189976 A188272 A104551 * A185785 A185905 A341244 Adjacent sequences:  A100743 A100744 A100745 * A100747 A100748 A100749 KEYWORD easy,nonn AUTHOR Paul Barry, Dec 06 2004 EXTENSIONS Definition corrected by N. J. A. Sloane, Dec 20 2019 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 May 18 14:11 EDT 2021. Contains 343995 sequences. (Running on oeis4.)