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-2 of 2 results.

A067975 a(n+1) is the smallest number > a(n) such that the digits of a(n)^2 are all (with multiplicity) contained in the digits of a(n+1)^2, with a(0)=2.

Original entry on oeis.org

2, 7, 43, 136, 367, 1157, 1822, 3658, 5558, 6196, 9679, 10183, 11794, 17852, 20813, 28354, 32193, 42852, 53787, 55044, 55707, 55983, 57636, 58464, 61719, 70209, 95232, 96354, 96921, 96963, 101407, 114223, 114323, 133564, 162293, 170843
Offset: 0

Views

Author

Marc Paulhus, Feb 05 2002

Keywords

Comments

a(n) for n>0 remains the same when a(0)=3. If "contained in" is replaced by "properly contained in" we get A065298.

Examples

			1157^2 = 1338649 and 1822 is the next smallest number whose square (in this case 3319684) contains the digits 1,3,3,8,6,4,9.
		

Crossrefs

A067974 a(n+1) is the smallest cube > a(n) such that the digits of a(n) are all (with multiplicity) contained in the digits of a(n+1), with a(0)=1.

Original entry on oeis.org

1, 125, 512, 15625, 1157625, 311665752, 19356769125, 291566137591, 5131167956992, 110979523759616, 1295599371716096, 16597961902739125, 191569168079975232, 982095927615711936, 1081935177662959192, 1091762925561991873, 1196109781753695229, 1293596679780115192
Offset: 0

Views

Author

Marc Paulhus, Feb 05 2002

Keywords

Crossrefs

Formula

a(n) = A067973(n)^3.

Extensions

More terms from Sean A. Irvine, Jan 16 2024
Showing 1-2 of 2 results.