id:A140998 - OEIS Search Results

Search: id:A140998

Displaying 1-1 of 1 results found.

page 1

Triangle read by rows: recurence 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-2)+G(n+2, k-1), for k:=1..(n+1).

+0
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; listen)

	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 this_sequence A048004 A114394 A059623` `Adjacent sequences: A140995 A140996 A140997 this_sequence A140999 A141000 A141001`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Juri-Stepan Gerasimov (2stepan(AT)rambler.ru), Jul 08 2008`

page 1

Search completed in 0.002 seconds

Last modified August 19 23:53 EDT 2008. Contains 142930 sequences.

AT&T Labs Research