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!)
A319483 a(n) = A128921(n)^2. 1

%I #25 Jun 23 2022 19:32:49

%S 0,1,4,9,121,484,1089,9801,10201,12321,14641,40804,44944,1002001,

%T 1234321,4008004,100020001,102030201,104060401,121242121,123454321,

%U 125686521,400080004,404090404,10000200001,10221412201,12102420121,12345654321,40000800004,1000002000001

%N a(n) = A128921(n)^2.

%e b(n) = reverse of a(n).

%e n | A128921(n) | a(n) | b(n) | Root of b(n) |

%e --+------------+--------+--------+--------------+

%e 1 | 0 | 0 | 0 | 0 |

%e 2 | 1 | 1 | 1 | 1 |

%e 3 | 2 | 4 | 4 | 2 |

%e 4 | 3 | 9 | 9 | 3 |

%e 5 | 11 | 121 | 121 | 11 |

%e 6 | 22 | 484 | 484 | 22 |

%e 7 | 33 | 1089 | 9801 | 99 |

%e 8 | 99 | 9801 | 1089 | 33 |

%e 9 | 101 | 10201 | 10201 | 101 |

%o (Python)

%o from itertools import count, chain, islice

%o from sympy.ntheory.primetest import is_square

%o def A319483_gen(): # generator of terms

%o return filter(lambda n:is_square(int(str(n)[::-1])),map(lambda n: n**2, chain((0,),chain.from_iterable(chain((int((s:=str(d))+s[-2::-1]) for d in range(10**l,10**(l+1))), (int((s:=str(d))+s[::-1]) for d in range(10**l,10**(l+1)))) for l in count(0)))))

%o A319483_list = list(islice(A319483_gen(),20)) # _Chai Wah Wu_, Jun 23 2022

%Y Cf. A002113, A128921, A319482.

%K nonn,base

%O 1,3

%A _Seiichi Manyama_, Sep 20 2018

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 23 22:36 EDT 2024. Contains 371917 sequences. (Running on oeis4.)