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.

A061226 a(n) = n^2 + (n^2 with digits reversed).

This page as a plain text file.
%I A061226 #25 Dec 06 2024 21:44:02
%S A061226 0,2,8,18,77,77,99,143,110,99,101,242,585,1130,887,747,908,1271,747,
%T A061226 524,404,585,968,1454,1251,1151,1352,1656,1271,989,909,1130,5225,
%U A061226 10890,7667,6446,8217,11000,5885,2772,1661,3542,6435,11330,8327,7227,8228
%N A061226 a(n) = n^2 + (n^2 with digits reversed).
%H A061226 Seiichi Manyama, <a href="/A061226/b061226.txt">Table of n, a(n) for n = 0..10000</a> (terms 0..1000 from Harry J. Smith)
%F A061226 a(n) = A000290(n) + A002942(n).
%e A061226 a(4) = 77 = 16 + 61; a(7) = 143 = 49 + 94.
%p A061226 R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):
%p A061226 a:= n-> (s-> s+R(s))(n^2):
%p A061226 seq(a(n), n=0..50);  # _Alois P. Heinz_, Sep 24 2018
%t A061226 nsr[n_]:=Module[{n2=n^2},n2+FromDigits[Reverse[IntegerDigits[n2]]]]; Array[ nsr,50,0] (* _Harvey P. Dale_, Jul 23 2012 *)
%o A061226 (PARI) {a(n) = n^2+fromdigits(Vecrev(digits(n^2)))} \\ _Seiichi Manyama_, Sep 24 2018
%Y A061226 Cf. A000290, A002942, A056964.
%K A061226 nonn,base,easy,look
%O A061226 0,2
%A A061226 _Amarnath Murthy_, Apr 22 2001
%E A061226 More terms from _Patrick De Geest_, May 29 2001