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

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A072170 Square array T(n,k) (n >= 0, k >= 2) read by antidiagonals, where T(n,k) is the number of ways of writing n as Sum_{i=0..inf} c_i 2^i, c_i in {0,1,...,k-1}. 7
1, 1, 1, 1, 1, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 1, 3, 2, 2, 1, 1, 1, 2, 3, 2, 2, 1, 1, 1, 3, 3, 4, 2, 2, 1, 1, 1, 1, 4, 3, 4, 2, 2, 1, 1, 1, 4, 4, 5, 4, 4, 2, 2, 1, 1, 1, 3, 5, 4, 5, 4, 4, 2, 2, 1, 1, 1, 5, 6, 8, 5, 6, 4, 4, 2, 2, 1, 1, 1, 2, 6, 6, 8, 5, 6, 4, 4, 2, 2, 1, 1, 1, 5, 6, 9, 8, 9, 6, 6 (list; table; graph; refs; listen; history; internal format)
OFFSET

0,8

COMMENTS

k-th column is k-th binary partition function.

REFERENCES

B. Reznick, Some binary partition functions, in "Analytic number theory" (Conf. in honor P. T. Bateman, Allerton Park, IL, 1989), 451-477, Progr. Math., 85, Birkhaeuser Boston, Boston, MA, 1990.

EXAMPLE

Array begins:

1 1 1 1 1 1 1 1 ...

1 1 1 1 1 1 1 1 ...

1 2 2 2 2 2 2 2 ...

1 1 2 2 2 2 2 2 ...

1 2 3 3 4 4 4 4 ...

1 3 4 5 5 6 6 6 ...

CROSSREFS

k=3 column is A002487, k=4 is integers doubled up, k=5, 6, 7 are A007728, A007729, A007730, limiting (infinity) column is A000123 doubled up.

Sequence in context: A151683 A133912 A122934 * A056624 A193348 A093997

Adjacent sequences:  A072167 A072168 A072169 * A072171 A072172 A072173

KEYWORD

nonn,tabl

AUTHOR

N. J. A. Sloane (njas(AT)research.att.com), Jun 29 2002

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 17 07:41 EST 2012. Contains 205998 sequences.