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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140998 Triangle read by rows: recurrence G(n,k): G(n, 0)=G(n+1,n+1)=1, G(n+2, n+1)=2, G(n+3, k)=G(n+1,k-1)+G(n+1, k)+G(n+2, k), for k:=1..(n+1). 10
1, 1, 1, 1, 2, 1, 1, 4, 2, 1, 1, 7, 5, 2, 1, 1, 12, 11, 5, 2, 1, 1, 20, 23, 12, 5, 2, 1, 1, 33, 46, 28, 12, 5, 2, 1, 1, 54, 89, 63, 29, 12, 5, 2, 1, 1, 88, 168, 137, 69, 29, 12, 5, 2, 1, 1, 143, 311, 289, 161, 70, 29, 12, 5, 2, 1, 1, 232, 567, 594, 367, 168, 70, 29, 12, 5, 2, 1, 1, 376 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,5

LINKS

Juri-Stepan Gerasimov, Stepan's triangles and Pascal's triangle are connected by the recurrence relation ...

EXAMPLE

Triangle begins:

1

1 1

1 2 1

1 4 2 1

1 7 5 2 1

1 12 11 5 2 1

1 20 23 12 5 2 1

1 33 46 28 12 5 2 1

1 54 89 63 29 12 5 2 1

1 88 168 137 69 29 12 5 2 1

1 143 311 289 161 70 29 12 5 2 1

CROSSREFS

Cf. A007318.

Sequence in context: A124022 A098063 A106396 * A048004 A114394 A059623

Adjacent sequences:  A140995 A140996 A140997 * A140999 A141000 A141001

KEYWORD

nonn,tabl

AUTHOR

Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 08 2008

EXTENSIONS

Indices in the definition corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Aug 02 2009

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 16 06:27 EST 2012. Contains 205860 sequences.