id:A071619 - OEIS Search Results

Search: id:A071619

Displaying 1-1 of 1 results found.

page 1

If n mod 3 = 0 then 6*(n/3)^2 elif n mod 3 = 1 then 6*((n-1)/3)^2+4*(n-1)/3+1 else 6*((n-2)/3)^2+8*(n-2)/3 +3.

+0
4

0, 1, 3, 6, 11, 17, 24, 33, 43, 54, 67, 81, 96, 113, 131, 150, 171, 193, 216, 241, 267, 294, 323, 353, 384, 417, 451, 486, 523, 561, 600, 641, 683, 726, 771, 817, 864, 913, 963, 1014, 1067, 1121, 1176, 1233, 1291, 1350, 1411, 1473, 1536, 1601, 1667, 1734, 1803, 1873 (list; graph; listen)

	OFFSET	`0,3`
	LINKS	`S. Lafortune, A. Ramani, B. Grammaticos, Y. Ohta and K.M. Tamizhmani, Blending two discrete integrability criteria: ...`
	FORMULA	`a(n) = 2/3n^2 if n mod 3 = 0 else 2/3n^2+1/3. Recurrence: a(n) = 2a(n-1)-a(n-2)+a(n-3)-2a(n-4)+a(n-5). G.f.: x(1+x)(1+x^2)/(1+x+x^2)/(1-x)^3. - Vladeta Jovovic (vladeta(AT)eunet.rs), Jun 23 2002`
	MAPLE	`A071619 := proc(n) if n mod 3 = 0 then 6(n/3)^2 elif n mod 3 = 1 then 6((n-1)/3)^2+4(n-1)/3+1 else 6((n-2)/3)^2+8*(n-2)/3 +3; fi; end;`
	CROSSREFS	`Partial sums of A042968.` `Sequence in context: A034029 A034031 A065504 this_sequence A025735 A023601 A109413` `Adjacent sequences: A071616 A071617 A071618 this_sequence A071620 A071621 A071622`
	KEYWORD	`nonn`
	AUTHOR	`N. J. A. Sloane (njas(AT)research.att.com), Jun 21 2002`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research