0,3

Zero followed by partial sums of A017281. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 20 2008]

A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, pps. 194-196.

L. Hogben, Choice and Chance by Cardpack and Chessboard. Vol. 1, Chanticleer Press, NY, 1950, p. 36.

Murray R. Spiegel, Calculus of Finite Differences and Difference Equations, "Schaum's Outline Series", McGraw-Hill, 1971, pps. 10-20, 79-94.

T. D. Noe, Table of n, a(n) for n=0..1000

Index entries for sequences related to linear recurrences with constant coefficients

n*(5*n-4).

G.f.: x*(1+9*x)/(1-x)^3.

a(n) = Sum_{k=0..n-1} 10*k+1. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 20 2008]

a(n)=10*n+a(n-1)-19 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 12 2009]

For n=2, a(2)=10*2+0-19=1; n=3, a(3)=10*3+1-19=12; n=4, a(4)=10*4+12-19=33 [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Nov 12 2009]

a[0]:=0:a[1]:=1:for n from 2 to 50 do a[n]:=2*a[n-1]-a[n-2]+10 od: seq(a[n], n=0..42); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 18 2008

s=0; lst={s}; Do[s+=n++ +1; AppendTo[lst, s], {n, 0, 6!, 10}]; lst [From Vladimir Orlovsky (4vladimir(AT)gmail.com), Nov 15 2008]

(MAGMA) [ n eq 1 select 0 else Self(n-1)+10*(n-2)+1: n in [1..43] ]; [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), Nov 20 2008]

First differences of A007587. Cf. A051682.

Cf. A093645 ((10, 1) Pascal, column m=2). Partial sums of A017281.

Cf. A000217, A051682, A051865.

Sequence in context: A079561 A131543 A063296 this_sequence A039338 A118337 A032604

Adjacent sequences: A051621 A051622 A051623 this_sequence A051625 A051626 A051627

easy,nonn

Barry E. Williams

More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 09 1999