Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119412
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A119412 Sum((binomial(2,3*j)+n),j=12..n). +0
2
0, 12, 26, 42, 60, 80, 102, 126, 152, 180, 210, 242, 276, 312, 350, 390, 432, 476, 522, 570, 620, 672, 726, 782, 840, 900, 962, 1026, 1092, 1160, 1230, 1302, 1376, 1452, 1530, 1610, 1692, 1776, 1862, 1950, 2040, 2132, 2226, 2322, 2420, 2520 (list; graph; listen)
OFFSET

11,2

FORMULA

Equals 2*A056115 - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 12 2007

a(n)=n*((n+3)*5-(n+1)*4), n>=0 . - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 06 2007

MAPLE

a:=n->sum((binomial(2, 3*j)+n), j=12..n): seq(a(n), n=11..56);

a:=n->sum(n, j=12..n): seq(a(n), n=11..56); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Feb 12 2007

seq(n*((n+3)*5-(n+1)*4), n=0..45); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 06 2007

seq(GAMMA(n+7)/GAMMA(n+5)-30, n=0..45); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 23 2007

CROSSREFS

Cf. A063930.

Adjacent sequences: A119409 A119410 A119411 this_sequence A119413 A119414 A119415

Sequence in context: A025138 A075689 A054303 this_sequence A105814 A030736 A003346

KEYWORD

easy,nonn

AUTHOR

Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Jul 26 2006

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 October 10 20:39 EDT 2008. Contains 144831 sequences.


AT&T Labs Research