login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A110665 Sequence is {a(0,n)}, where a(m,0)=0, a(m,n) = a(m-1,n)+a(m,n-1) and a(0,n) is such that a(n,n) = n for all n. 7
0, 1, 0, -3, -4, 0, 6, 7, 0, -9, -10, 0, 12, 13, 0, -15, -16, 0, 18, 19, 0, -21, -22, 0, 24, 25, 0, -27, -28, 0, 30, 31, 0, -33, -34, 0, 36, 37, 0, -39, -40, 0, 42, 43, 0, -45, -46, 0, 48, 49, 0, -51, -52, 0, 54, 55, 0, -57, -58, 0, 60, 61, 0, -63, -64, 0, 66, 67, 0, -69, -70, 0, 72, 73, 0, -75, -76, 0, 78, 79 (list; graph; refs; listen; history; internal format)
OFFSET

0,4

FORMULA

a(0, n) = n - sum{k=0 to n-1) binomial(2n-k-1, n-1) a(0, k)

a(n) = n * A010892(n), where A010892 is periodic sequence [1,1,0,-1,-1,0]. G.f. (x-2x^2)/(1-x+x^2)^2. - Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 12 2006

EXAMPLE

a(0,n): 0, 1, 0, -3, -4,...

a(1,n): 0, 1, 1, -2, -6,...

a(2,n): 0, 1, 2, 0, -6,...

a(3,n): 0, 1, 3, 3, -3,...

a(4,n): 0, 1, 4, 7, 4,...

Main diagonal of array is 0, 1, 2, 3, 4,...

CROSSREFS

Cf. A110666, A110667, A110668, A110669, A110670, A110671, A110672.

Sequence in context: A158677 A105576 A105826 * A063441 A092894 A011338

Adjacent sequences:  A110662 A110663 A110664 * A110666 A110667 A110668

KEYWORD

easy,sign

AUTHOR

Leroy Quet Aug 02 2005

EXTENSIONS

More terms from Frank Adams-Watters (FrankTAW(AT)Netscape.net), May 12 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 17 12:36 EST 2012. Contains 206021 sequences.