id:A054081 - OEIS Search Results

Search: id:A054081

Displaying 1-1 of 1 results found.

page 1

Array T by antidiagonals: for n >= 0 and k >= 1, let p(k)=least number in N not already an a(i), q(k)=p(k)+k+n-1, a(p(k))=q(k), a(q(k))=p(k); then for h>=1, T(n,h)=a(h).

+0
1

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

	OFFSET	`1,2`
	COMMENT	`Each row is a self-inverse permutation of N; are the numbers in every column distinct?`
	LINKS	`Index entries for sequences that are permutations of the natural numbers`
	EXAMPLE	`Row 0: 1 3 2 6 8 4 11 ... = A019444.` `Row 1: 2 1 5 7 3 10 4 ... = A002251.` `Row 2: 3 5 1 8 2 11 13 ...`
	CROSSREFS	`Adjacent sequences: A054078 A054079 A054080 this_sequence A054082 A054083 A054084` `Sequence in context: A088435 A074976 A068448 this_sequence A050604 A131015 A130195`
	KEYWORD	`nonn,tabl,eigen`
	AUTHOR	`Clark Kimberling (ck6(AT)evansville.edu)`

page 1

Search completed in 0.002 seconds

Last modified October 13 20:18 EDT 2008. Contains 145016 sequences.

AT&T Labs Research