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!)
A061226 a(n) = n^2 + (n^2 with digits reversed). 3

%I #22 Sep 24 2018 11:43:17

%S 0,2,8,18,77,77,99,143,110,99,101,242,585,1130,887,747,908,1271,747,

%T 524,404,585,968,1454,1251,1151,1352,1656,1271,989,909,1130,5225,

%U 10890,7667,6446,8217,11000,5885,2772,1661,3542,6435,11330,8327,7227,8228

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

%H 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 a(n) = A000290(n) + A002942(n).

%e a(4) = 77 = 16 + 61; a(7) = 143 = 49 + 94.

%p R:= n-> (s-> parse(cat(s[-i]$i=1..length(s))))(""||n):

%p a:= n-> (s-> s+R(s))(n^2):

%p seq(a(n), n=0..50); # _Alois P. Heinz_, Sep 24 2018

%t nsr[n_]:=Module[{n2=n^2},n2+FromDigits[Reverse[IntegerDigits[n2]]]]; Array[ nsr,50,0] (* _Harvey P. Dale_, Jul 23 2012 *)

%o (PARI) { for (n=0, 1000, x=n^2; r=0; while (x>0, d=x-10*(x\10); x\=10; r=r*10 + d); write("b061226.txt", n, " ", n^2 + r) ) } \\ _Harry J. Smith_, Jul 19 2009

%o (PARI) {a(n) = n^2+fromdigits(Vecrev(digits(n^2)))} \\ _Seiichi Manyama_, Sep 24 2018

%Y Cf. A000290, A002942, A056964.

%K nonn,base,easy,look

%O 0,2

%A _Amarnath Murthy_, Apr 22 2001

%E More terms from _Patrick De Geest_, May 29 2001

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 25 01:35 EDT 2024. Contains 371964 sequences. (Running on oeis4.)