id:A080080 - OEIS Search Results

Search: id:A080080

Displaying 1-1 of 1 results found.

page 1

T(n,k) = length of longest carry sequence when adding k to n in binary representation, 1<=k<=n (triangular array).

+0
3

1, 0, 1, 2, 1, 1, 0, 0, 0, 1, 1, 0, 3, 1, 1, 0, 2, 2, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 2, 0, 1, 0, 4, 1, 1, 0, 1, 1, 0, 0, 3, 3, 1, 1, 1, 2, 1, 1, 0, 4, 3, 3, 1, 2, 1, 1, 0, 0, 0, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 0, 4, 2, 2, 2, 2, 1, 1, 1, 3, 1, 1, 0, 3, 3, 2, 2, 2, 2, 1, 1, 2, 2, 1, 1, 1 (list; table; graph; listen)

	OFFSET	`1,4`
	COMMENT	`T(n,1) = A007814(n+1), T(n,n) = 1; for n>1: T(n,n-1) = A043545(n+1); T(n,k) <= A070940(n) = T(n, A080079(n)).`
	EXAMPLE	`Triangle begins:` `.............1` `...........0...1` `.........2...1...1` `.......0...0...0...1` `.....1...0...3...1...1` `...0...2...2...1...1...1` `.3...2...2...1...2...1...1.`
	CROSSREFS	`Adjacent sequences: A080077 A080078 A080079 this_sequence A080081 A080082 A080083` `Sequence in context: A035185 A086013 A064692 this_sequence A093662 A025918 A030425`
	KEYWORD	`nonn,tabl,nice`
	AUTHOR	`Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 26 2003`

page 1

Search completed in 0.002 seconds

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

AT&T Labs Research