cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A118164 Number of representations of A005243(n) as sum of consecutive earlier terms in A005243.

Original entry on oeis.org

0, 0, 1, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 2, 2, 2, 1, 1, 1, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 2, 3, 1, 2, 3, 1, 2, 3, 2, 1, 1, 2, 1, 1, 1, 2, 3, 1, 1, 1, 1, 1, 3, 2, 1, 1, 1, 3, 2, 2, 1, 2, 1, 1, 1, 3, 1, 1, 4, 1, 2, 1, 3, 1, 2, 1, 2, 1, 1, 2, 2, 1, 3, 1, 3, 4, 2, 1, 3, 1, 2, 2, 2, 3, 1, 1, 1, 2, 2, 1, 3, 1, 1, 4
Offset: 1

Views

Author

Reinhard Zumkeller, Apr 13 2006

Keywords

Comments

A118165(n) = Min{m: a(m) = n};
for n>2: a(n) > 0 by definition of A005243.

Examples

			A005243(33) = 54 = 29+25 = Sum(A005243[17:18]) =
19+18+17 = Sum(A005243[11:13]) = 14+11+10+8+6+5 =
Sum(A005243[4:9]), therefore a(33) = 3.