id:A062001 - OEIS Search Results

Search: id:A062001

Displaying 1-1 of 1 results found.

page 1

A062001

Table by antidiagonals of n-Stohr sequences: T(n,k) is least positive integer not the sum of at most n distinct terms in the n-th row from T(n,1) through to T(n,k-1).

+0
3

1, 2, 1, 3, 2, 1, 4, 4, 2, 1, 5, 7, 4, 2, 1, 6, 10, 8, 4, 2, 1, 7, 13, 15, 8, 4, 2, 1, 8, 16, 22, 16, 8, 4, 2, 1, 9, 19, 29, 31, 16, 8, 4, 2, 1, 10, 22, 36, 46, 32, 16, 8, 4, 2, 1, 11, 25, 43, 61, 63, 32, 16, 8, 4, 2, 1, 12, 28, 50, 76, 94, 64, 32, 16, 8, 4, 2, 1, 13, 31, 57, 91, 125, 127 (list; table; graph; listen)

	OFFSET	`1,2`
	FORMULA	`If k<=n+1 then T(n, k)=2^(k-1), while if k>n T(n, k)=(2^n-1)(k-n)+1`
	CROSSREFS	`Rows include A000027, A033627, A026474, A051039, A051040. Diagonals include A000079, A000225, A033484, A036563, A048487. A048483 can be seen as half this table.` `Sequence in context: A131967 A137679 A105438 this_sequence A049280 A108786 A008315` `Adjacent sequences: A061998 A061999 A062000 this_sequence A062002 A062003 A062004`
	KEYWORD	`nonn,tabl`
	AUTHOR	`Henry Bottomley (se16(AT)btinternet.com), May 29 2001`

page 1

Search completed in 0.002 seconds

Last modified December 2 15:58 EST 2008. Contains 150992 sequences.

AT&T Labs Research