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

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A010743 Shifts 4 places left under inverse binomial transform. 5
1, 2, 4, 8, 1, 1, 1, 1, -14, 45, -101, 189, -331, 668, -1932, 7206, -27779, 101365, -347439, 1139851, -3690766, 12258863, -43341845, 166059261, -682516519, 2930522990, -12823188092, 56366526324, -247898684759, 1094571175769, -4890163717903, 22310147976797 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
LINKS
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, arXiv:math/0205301 [math.CO], 2002; Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to arXiv version]
M. Bernstein and N. J. A. Sloane, Some canonical sequences of integers, Linear Alg. Applications, 226-228 (1995), 57-72; erratum 320 (2000), 210. [Link to Lin. Alg. Applic. version together with omitted figures]
N. J. A. Sloane, Transforms
FORMULA
G.f. A(x) satisfies: A(x) = 1 + 2*x + 4*x^2 + 8*x^3 + x^4*A(x/(1 + x))/(1 + x). - Ilya Gutkovskiy, Feb 02 2022
MAPLE
a:= proc(n) option remember; (m-> `if`(m<0, 2^n,
add(a(m-j)*binomial(m, j)*(-1)^j, j=0..m)))(n-4)
end:
seq(a(n), n=0..35); # Alois P. Heinz, Feb 02 2022
MATHEMATICA
a[n_] := a[n] = Function[m, If[m < 0, 2^n, Sum[a[m - j]* Binomial[m, j]*(-1)^j, {j, 0, m}]]][n - 4];
Table[a[n], {n, 0, 35}] (* Jean-François Alcover, Mar 08 2023, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A339415 A097625 A371133 * A072032 A365814 A023104
KEYWORD
sign
AUTHOR
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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 16 08:27 EDT 2024. Contains 371698 sequences. (Running on oeis4.)