id:A047998 - OEIS Search Results

Search: id:A047998

Displaying 1-1 of 1 results found.

page 1

Triangle of numbers a(n,k) = number of "fountains" with n coins, k in the bottom row.

+0
3

1, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 0, 0, 2, 1, 0, 0, 0, 1, 3, 1, 0, 0, 0, 1, 3, 4, 1, 0, 0, 0, 0, 3, 6, 5, 1, 0, 0, 0, 0, 2, 7, 10, 6, 1, 0, 0, 0, 0, 1, 7, 14, 15, 7, 1, 0, 0, 0, 0, 1, 5, 17, 25, 21, 8, 1, 0, 0, 0, 0, 0, 5, 16, 35, 41, 28, 9, 1, 0, 0, 0, 0, 0, 3, 16, 40, 65, 63, 36, 10, 1 (list; table; graph; listen)

	OFFSET	`0,14`
	REFERENCES	`R. K. Guy, personal communication.` `See A005169 for further references.`
	EXAMPLE	`1; 0 1; 0 0 1; 0 0 1 1; 0 0 0 2 1;...`
	CROSSREFS	`Row sums give A005169.` `Adjacent sequences: A047995 A047996 A047997 this_sequence A047999 A048000 A048001` `Sequence in context: A022909 A032239 A057094 this_sequence A017847 A127841 A091006`
	KEYWORD	`nonn,tabl,easy,nice`
	AUTHOR	`njas`

page 1

Search completed in 0.002 seconds

Last modified May 22 15:55 EDT 2008. Contains 140006 sequences.

AT&T Labs Research