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.

A076031 Group the natural numbers so that the n-th group contains the smallest still-available set of n numbers whose product is a square.

Original entry on oeis.org

1, 2, 8, 3, 4, 12, 5, 6, 7, 210, 9, 10, 11, 13, 1430, 14, 15, 16, 17, 18, 1785, 19, 20, 21, 22, 23, 24, 168245, 25, 26, 27, 28, 29, 30, 31, 409045, 32, 33, 34, 35, 36, 37, 38, 39, 119629510, 40, 41, 42, 43, 44, 45, 46, 47, 48, 293493662, 49, 50, 51, 52
Offset: 1

Views

Author

Amarnath Murthy, Oct 01 2002

Keywords

Comments

The first n-1 numbers of row n are selected by simply choosing the smallest n-1 numbers which have not yet been used. The remaining number is then chosen to be the smallest possible unused number such that the product of the n numbers is a square. - Sean A. Irvine, Mar 14 2025

Examples

			1;
2, 8;
3, 4, 12;
5, 6, 7, 210;
9, 10, 11, 13, 1430;
14, 15, 16, 17, 18, 1785;
...
		

Crossrefs

Extensions

Corrected and extended by Hans Havermann, Nov 09 2002