Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A006578
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A006578 Triangular numbers plus quarter squares: n*(n+1)/2 + floor(n^2/4) (i.e. A000217(n) + A002620(n)).
(Formerly M3329)
+0
7
0, 1, 4, 8, 14, 21, 30, 40, 52, 65, 80, 96, 114, 133, 154, 176, 200, 225, 252, 280, 310, 341, 374, 408, 444, 481, 520, 560, 602, 645, 690, 736, 784, 833, 884, 936, 990, 1045, 1102, 1160, 1220, 1281, 1344, 1408, 1474, 1541, 1610, 1680, 1752, 1825, 1900, 1976, 2054 (list; graph; listen)
OFFSET

0,3

COMMENT

Equals (1, 2, 3, 4,...) convolved with (1, 2, 1, 2,...). a(4) = 14 = (1, 2, 3, 4) dot (2, 1, 2, 1) = (2 + 2 + 6 + 4). [From Gary W. Adamson (qntmpkt(AT)yahoo.com), May 01 2009]

REFERENCES

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Marc LeBrun (mlb(AT)well.com), personal communication.

LINKS

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

FORMULA

Expansion of x*(1+2x) / ((1-x)^2*(1-x^2)).

Partial sums of A032766. - Paul Barry (pbarry(AT)wit.ie), May 30 2003

a(n) = a(n-1)+a(n-2)-a(n-3)+3 = A002620(n)+A004526(n) = A002378(n)-A002620(n) = A001859(n)-A004526(n+1) - Henry Bottomley (se16(AT)btinternet.com), Mar 08 2000

a(n)=(6n^2+4n-1+(-1)^n)/8. - Paul Barry (pbarry(AT)wit.ie), May 30 2003

a(-1-n)=A001859(n). - Michael Somos May 10 2006

Row sums of triangle A104567 = (1, 4, 8, 14, 21,...). - Gary W. Adamson (qntmpkt(AT)yahoo.com), May 05 2007

MAPLE

A006578:=-(1+2*z)/(1+z)/(z-1)**3; [Conjectured by S. Plouffe in his 1992 dissertation.]

with (combinat):seq(count(Partition((3*n+1)), size=3), n=0..52); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 28 2008

PROGRAM

(PARI) a(n)=(3*(n+1)^2+1)\4-n-1 /* Michael Somos Mar 10 2006 */

CROSSREFS

Cf. A001859, A077043.

A006578 + A002620 = A002378 = n(n+1).

Cf. A104567.

Sequence in context: A131937 A088804 A027924 this_sequence A122224 A004797 A053459

Adjacent sequences: A006575 A006576 A006577 this_sequence A006579 A006580 A006581

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com).

EXTENSIONS

More terms from Larry Reeves (larryr(AT)acm.org), Mar 20 2000

Offset and description changed by N. J. A. Sloane (njas(AT)research.att.com), Nov 30 2006

page 1

Search completed in 0.003 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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research