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.

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

Original entry on oeis.org

2, 7, 43, 136, 367, 1157, 3658, 10183, 32193, 101407, 320537, 1001842, 3166463, 10001923, 31627114, 100017313, 316599084, 1000104687, 3162331407, 10000483663
Offset: 0

Views

Author

Floor van Lamoen, Oct 29 2001

Keywords

Comments

a(n) for n>0 remains the same when a(0)=3.

Examples

			43^2 = 1849 and 136 is the next smallest number whose square (in this case 18496) properly contains the digits 1,4,8,9.
		

Crossrefs

Extensions

More terms from Marc Paulhus, Feb 04 2002
a(18)-a(19) from Sean A. Irvine, Aug 26 2023