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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A140995 Triangle read by rows: recurrence G(n,k): G(n, n)=G(n+1, 0)=1, G(n+2, 1)=2, G(n+3, 2)=4, G(n+4, 3)=8, G(n+5, k)=G(n+1, k-3)+G(n+1, k-4)+G(n+2, k-3)+G(n+3, k-2)+ G(k+4, k-1), for k:=5..(n+5). 1
1, 1, 1, 1, 2, 1, 1, 2, 4, 1, 1, 2, 4, 8, 1, 1, 2, 4, 8, 16, 1, 1, 2, 4, 8, 17, 31, 1, 1, 2, 4, 8, 17, 35, 60, 1, 1, 2, 4, 8, 17, 35, 72, 116, 1, 1, 2, 4, 8, 17, 35, 72, 148, 224, 1, 1, 2, 4, 8, 17, 35, 72, 149, 303, 432, 1, 1, 2, 4, 8, 17, 35, 72, 149, 308, 618, 833, 1, 1, 2, 4, 8, 17, 35 (list; graph; refs; listen; history; internal format)
OFFSET

0,5

EXAMPLE

Triangle begins:

1

1 1

1 2 1

1 2 4 1

1 2 4 8 1

1 2 4 8 161

1 2 4 8 17 31 1

1 2 4 8 17 35 60 1

1 2 4 8 17 35 72 116 1

1 2 4 8 17 35 72 148 224 1

1 2 4 8 17 35 72 149 303 432 1

1 2 4 8 17 35 72 149 308 618 833 1

CROSSREFS

Cf. A007318.

Sequence in context: A166918 A143576 A023506 * A141021 A140994 A140993

Adjacent sequences:  A140992 A140993 A140994 * A140996 A140997 A140998

KEYWORD

nonn

AUTHOR

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

EXTENSIONS

Entries checked by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 14 2010

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 14 13:08 EST 2012. Contains 205623 sequences.