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.

A068522 In base 10 notation replace digits of n with their squared values (Version 2).

This page as a plain text file.
%I A068522 #25 Apr 02 2015 11:40:39
%S A068522 0,1,4,9,16,25,36,49,64,81,10,11,14,19,26,35,46,59,74,91,40,41,44,49,
%T A068522 56,65,76,89,104,121,90,91,94,99,106,115,126,139,154,171,160,161,164,
%U A068522 169,176,185,196,209,224,241,250,251,254,259
%N A068522 In base 10 notation replace digits of n with their squared values (Version 2).
%H A068522 Alois P. Heinz, <a href="/A068522/b068522.txt">Table of n, a(n) for n = 0..10000</a>
%F A068522 a(n) = Sum_{i=0..g} d(i)*d(i)*10^i, where n = Sum_{d=0..9} d(i)*10^i is the decimal expansion of n.
%e A068522 a(13) = a(1*10^1 + 3*10^0) = 1^2*10^1 + 3^2*10^0 = 10 + 9 = 19.
%e A068522 a(14) = a(1*10^1 + 4*10^0) = 1^2*10^1 + 4^2*10^0 = 10 + 16 = 26.
%e A068522 a(48) = a(4*10^1 + 8*10^0) = 4^2*10^1 + 8^2*10^0 = 160 + 64 = 224.
%p A068522 a:= n-> (s-> add(parse(s[-i])^2*10^(i-1), i=1..length(s)))(""||n):
%p A068522 seq(a(n), n=0..70);  # _Alois P. Heinz_, Jul 04 2014
%t A068522 FromDigits[IntegerDigits[#]^2] & /@ Range@ 53 (* _Michael De Vlieger_, Apr 01 2015 *)
%o A068522 (Haskell)
%o A068522 a068522 0 = 0
%o A068522 a068522 n = 10 * a068522 n' + m ^ 2  where (n', m) = divMod n 10
%o A068522 -- _Reinhard Zumkeller_, Jul 08 2014
%Y A068522 See A048385 for another version.
%K A068522 nonn,base
%O A068522 0,3
%A A068522 _Reinhard Zumkeller_, Mar 21 2002