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.

A338428 Multiplicities for A111774(n), for n >= 1.

Original entry on oeis.org

1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 1, 1, 1, 2, 1, 3, 2, 1, 2, 2, 1, 2, 1, 3, 1, 4, 1, 1, 1, 2, 2, 1, 3, 2, 1, 2, 1, 3, 1, 4, 2, 3, 1, 2, 3, 2, 1, 4, 1, 2, 3, 1, 3, 1, 3, 2, 1, 2, 1, 5, 2, 1, 2, 1, 2, 1, 2, 4, 1
Offset: 1

Views

Author

Wolfdieter Lang, Nov 23 2020

Keywords

Comments

See the triangle and array of A337940 for details.
The first n and N(n) = A111774(n) with multiplicity m are [m, n, N] = [1, 1, 6], [2, 6, 15], [3, 16, 30], [4, 26, 45], [5, 60, 90], [6, 72, 105], [7, 157, 210], ...

Examples

			For a(6) = 2 for  A111774(6) = 15 see the example given in A337940.
Similarly for a(24) = 3 for A111774(24) = 42.
		

Crossrefs

Formula

a(n) gives the number of possibilities to write A111774(n) as a sum of at least three consecutive positive integers.