Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A051624
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A051624
%S A051624 0,1,12,33,64,105,156,217,288,369,460,561,672,793,924,1065,1216,
%T A051624 1377,1548,1729,1920,2121,2332,2553,2784,3025,3276,3537,3808,4089,
%U A051624 4380,4681,4992,5313,5644,5985,6336,6697,7068,7449,7840,8241,8652
%N A051624 12-gonal numbers.
%C A051624 Zero followed by partial sums of A017281. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Nov 20 2008]
%D A051624 A. H. Beiler, Recreations in the Theory of Numbers, Dover, N.Y., 1964, 
               pps. 194-196.
%D A051624 L. Hogben, Choice and Chance by Cardpack and Chessboard. Vol. 1, Chanticleer 
               Press, NY, 1950, p. 36.
%D A051624 Murray R. Spiegel, Calculus of Finite Differences and Difference Equations, 
               "Schaum's Outline Series", McGraw-Hill, 1971, pps. 10-20, 79-94.
%H A051624 T. D. Noe, <a href="b051624.txt">Table of n, a(n) for n=0..1000</a>
%H A051624 <a href="Sindx_Rea.html#recLCC">Index entries for sequences related to 
               linear recurrences with constant coefficients</a>
%F A051624 n*(5*n-4).
%F A051624 G.f.: x*(1+9*x)/(1-x)^3.
%F A051624 a(n) = Sum_{k=0..n-1} 10*k+1. [From Klaus Brockhaus (klaus-brockhaus(AT)t-online.de), 
               Nov 20 2008]
%F A051624 a(n)=10*n+a(n-1)-19 (with a(1)=0) [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), 
               Nov 12 2009]
%e A051624 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]
%p A051624 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
%t A051624 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]
%o A051624 (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]
%Y A051624 First differences of A007587. Cf. A051682.
%Y A051624 Cf. A093645 ((10, 1) Pascal, column m=2). Partial sums of A017281.
%Y A051624 Cf. A000217, A051682, A051865.
%Y A051624 Sequence in context: A079561 A131543 A063296 this_sequence A039338 A118337 
               A032604
%Y A051624 Adjacent sequences: A051621 A051622 A051623 this_sequence A051625 A051626 
               A051627
%K A051624 easy,nonn,new
%O A051624 0,3
%A A051624 Barry E. Williams
%E A051624 More terms from James A. Sellers (sellersj(AT)math.psu.edu), Dec 09 1999

    
page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified November 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research