login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A067713 a(n+1) is the smallest square > 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. 0

%I #5 Jan 03 2024 16:28:29

%S 1,16,169,196,961,1296,2916,9216,12769,96721,237169,729316,1073296,

%T 1630729,2709316,10329796,69739201,109327936,130279396,133079296,

%U 133702969,309971236,317302969,917302369,1353209796,1725903936

%N a(n+1) is the smallest square > 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.

%F a(n) = A014563(n)^2.

%Y Cf. A014563.

%K base,nonn

%O 0,2

%A _Marc Paulhus_, Feb 05 2002

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 22:17 EDT 2024. Contains 371964 sequences. (Running on oeis4.)