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.

This page as a plain text file.
%I A065298 #10 Aug 26 2023 23:26:05
%S A065298 2,7,43,136,367,1157,3658,10183,32193,101407,320537,1001842,3166463,
%T A065298 10001923,31627114,100017313,316599084,1000104687,3162331407,
%U A065298 10000483663
%N 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.
%C A065298 a(n) for n>0 remains the same when a(0)=3.
%e A065298 43^2 = 1849 and 136 is the next smallest number whose square (in this case 18496) properly contains the digits 1,4,8,9.
%Y A065298 Cf. A050630, A050631, A048559, A050636, A065297.
%K A065298 base,nonn,more
%O A065298 0,1
%A A065298 _Floor van Lamoen_, Oct 29 2001
%E A065298 More terms from _Marc Paulhus_, Feb 04 2002
%E A065298 a(18)-a(19) from _Sean A. Irvine_, Aug 26 2023