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.

Showing 1-1 of 1 results.

A306248 Smallest m for which 2n is not m-powerful (for the definition of k-powerful see A323395).

Original entry on oeis.org

1, 2, 1, 3, 1, 3, 1, 4, 1, 3, 1, 4, 1, 3, 1, 5, 1, 3, 1, 5, 1, 3, 1, 6, 1, 3, 1, 5, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 8, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1, 7, 1, 3, 1, 6, 1, 3, 1
Offset: 1

Views

Author

Stan Wagon, Jan 31 2019

Keywords

Comments

This function is known as m*(2n). For odd n all values of m*(n) are 0.

Examples

			The bipartition {1,4}, {2,3} of {1,2,3,4} has equal first power-sums. But there is no such bipartition with equal power-sums for exponents 0, 1, and 2. Therefore a(2) = 2.
		

Crossrefs

Extensions

a(56) corrected by Stan Wagon, May 06 2019
a(72) corrected by Stan Wagon, May 24 2019
Showing 1-1 of 1 results.