cp's OEIS Frontend

A248126 a(n) = n^2 with each digit repeated.

%I A248126 #44 Dec 02 2023 16:37:30
%S A248126 11,44,99,1166,2255,3366,4499,6644,8811,110000,112211,114444,116699,
%T A248126 119966,222255,225566,228899,332244,336611,440000,444411,448844,
%U A248126 552299,557766,662255,667766,772299,778844,884411,990000,996611,11002244,11008899,11115566
%N A248126 a(n) = n^2 with each digit repeated.
%C A248126 Inspired by A116699.
%H A248126 Michael De Vlieger, <a href="/A248126/b248126.txt">Table of n, a(n) for n = 1..10000</a>
%e A248126 13^2 = 169, so a(13) = 116699.
%t A248126 a248126[n_Integer] :=
%t A248126 Module[{m}, m := IntegerDigits[n^2];
%t A248126   FromDigits[Flatten[Transpose[List[m, m]]]]]; a248126 /@ Range[34] (* _Michael De Vlieger_, Nov 06 2014 *)
%t A248126 Table[FromDigits[Riffle[id=IntegerDigits[n^2],id]],{n,40}] (* _Harvey P. Dale_, Dec 19 2015 *)
%o A248126 (JavaScript)
%o A248126 for (i=1;i<40;i++) {
%o A248126 s=(i*i).toString();
%o A248126 for (j=0;j<s.length;j++) document.write(s.charAt(j)+s.charAt(j));
%o A248126 document.write(", ");
%o A248126 }
%o A248126 (PARI) a(n)= my(d = 11*digits(n^2)); fromdigits(d, 100) \\ _David A. Corneth_, Dec 02 2023
%o A248126 (Python)
%o A248126 def a(n): return int("".join(d*2 for d in str(n**2)))
%o A248126 print([a(n) for n in range(1, 35)]) # _Michael S. Branicky_, Dec 02 2023
%Y A248126 Cf. A020338, A044836.
%Y A248126 Cf. A116699, A338754.
%K A248126 nonn,easy,base
%O A248126 1,1
%A A248126 _Jon Perry_, Nov 01 2014