id:A066202 - OEIS Search Results

Search: id:A066202

Displaying 1-1 of 1 results found.

page 1

Array T(n,k) (n>=1, k>=1) read by antidiagonals: T(n,n) = 1 for all n; fill in array above diagonal by symmetry; for row n, starting at diagonal T(n,n)=1, for k > n, T(n,k) = T(n,k-1)-(k-1) if this is positive and has not already appeared in this row, otherwise T(n,k) = T(n,k-1)+(k-1).

+0
4

1, 2, 2, 4, 1, 4, 7, 3, 3, 7, 3, 6, 1, 6, 3, 8, 10, 4, 4, 10, 8, 14, 5, 8, 1, 8, 5, 14, 21, 11, 13, 5, 5, 13, 11, 21, 13, 4, 7, 10, 1, 10, 7, 4, 13, 22, 12, 14, 16, 6, 6, 16, 14, 12, 22, 12, 21, 6, 9, 12, 1, 12, 9, 6, 21, 12, 23, 31, 15, 17, 19, 7, 7, 19, 17, 15, 31, 23, 11, 20, 5, 8, 11, 14, 1 (list; table; graph; listen)

	OFFSET	`1,2`
	LINKS	`Index entries for sequences related to Recaman's sequence`
	EXAMPLE	`Array begins` `1 2 4 7 3 8 ...` `2 1 3 6 10 5 ...` `4 3 1 4 8 13 ...` `7 6 4 1 5 10 ...`
	CROSSREFS	`Rows give A063733, A066203, A066204. Cf. A066201 for another version.` `Sequence in context: A065273 A111580 A138558 this_sequence A027420 A116588 A069922` `Adjacent sequences: A066199 A066200 A066201 this_sequence A066203 A066204 A066205`
	KEYWORD	`nonn,easy,tabl`
	AUTHOR	`njas, Dec 16 2001`
	EXTENSIONS	`More terms from Antonio G. Astudillo (afg_astudillo(AT)lycos.com), Apr 06 2003`

page 1

Search completed in 0.002 seconds

Last modified August 8 15:51 EDT 2008. Contains 142751 sequences.

AT&T Labs Research