login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080080 T(n,k) = length of longest carry sequence when adding k to n in binary representation, 1<=k<=n (triangular array). 2
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; refs; listen; history; internal format)
OFFSET

1,4

COMMENTS

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

Sequence in context: A086013 A167687 A064692 * A093662 A025918 A030425

Adjacent sequences:  A080077 A080078 A080079 * A080081 A080082 A080083

KEYWORD

nonn,tabl,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jan 26 2003

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 14 20:38 EST 2012. Contains 205663 sequences.