A167876 A000004 preceded by 1, 3, 4, 2.

1, 3, 4, 2, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0

Offset: 0

Author

Klaus Brockhaus, Nov 14 2009

Keywords

• easy
• nonn

Comments

Inverse binomial transform of A167875.

Crossrefs

Cf. A000004 (zero sequence), A167875 (one third of product plus sum of three consecutive nonnegative integers), A166926 (1, 2, 4, 0, 0, 0, 0, ...), A130706 (1, 2, 0, 0, 0, 0, ...), A130779 (1, 1, 2, 0, 0, 0, 0, ...), A167858 (3, 14, 36, 36, 12, 0, 0, 0, ...).

Programs

PARI

{concat([1, 3, 4, 2], vector(99))}

Formula

a(0) = 1, a(1) = 3, a(2) = 4, a(3) = 2, a(n) = 0 for n > 3.

G.f.: (1+x)*(1+2*x+2*x^2).