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.
%I A053061 #47 Jul 02 2025 16:01:59
%S A053061 11,24,39,416,525,636,749,864,981,10100,11121,12144,13169,14196,15225,
%T A053061 16256,17289,18324,19361,20400,21441,22484,23529,24576,25625,26676,
%U A053061 27729,28784,29841,30900,31961,321024,331089,341156,351225,361296,371369,381444,391521
%N A053061 a(n) is the decimal concatenation of n and n^2.
%D A053061 Felice Russo, A set of new Smarandache functions, sequences and conjectures in number theory, American Research Press 2000
%H A053061 Georg Fischer, <a href="/A053061/b053061.txt">Table of n, a(n) for n = 1..10000</a>
%F A053061 a(n) = n*(10^floor(2*log_10(n) + 1) + n). - _Henry Bottomley_, May 18 2000
%F A053061 a(n) ~ n^3. - _Charles R Greathouse IV_, Sep 19 2012
%t A053061 Table[FromDigits[Join[IntegerDigits[n],IntegerDigits[n^2]]],{n,40}] (* _Harvey P. Dale_, May 24 2012 *)
%o A053061 (Magma) [Seqint(Intseq(n^2) cat Intseq(n)): n in [1..40]]; // _Vincenzo Librandi_, Jan 03 2015
%o A053061 (Python)
%o A053061 def a(n): return int(str(n) + str(n*n))
%o A053061 print([a(n) for n in range(1, 40)]) # _Michael S. Branicky_, Nov 24 2021
%Y A053061 Cf. A020338, A055436, A061086, A175605, A253445.
%K A053061 easy,nonn,base
%O A053061 1,1
%A A053061 _Felice Russo_, Feb 25 2000
%E A053061 More terms from _James Sellers_, Feb 28 2000