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.

A245361 Numbers n such that (reversal of digits of n) + 1 is a square (ignoring leading zeros).

This page as a plain text file.
%I A245361 #15 May 24 2017 21:06:36
%S A245361 3,8,30,36,42,51,53,80,84,99,300,323,341,360,384,387,420,422,426,510,
%T A245361 530,552,575,576,591,800,825,827,840,861,882,990,993,998,3000,3032,
%U A245361 3069,3072,3201,3230,3264,3276,3410,3441,3477,3483,3600,3633,3648,3671,3806
%N A245361 Numbers n such that (reversal of digits of n) + 1 is a square (ignoring leading zeros).
%C A245361 (Reversal of digits of prime p) plus 1 is square is given in A167217.
%H A245361 K. D. Bajpai, <a href="/A245361/b245361.txt">Table of n, a(n) for n = 1..6696</a>
%e A245361 84 is in the sequence because reversal of its digits is 48 and 48 + 1 = 49 = 7^2.
%e A245361 510 is in the sequence because reversal of its digits is 15 and 15 + 1 = 16 = 4^2.
%t A245361 Select[Range[10^4],IntegerQ[Sqrt[FromDigits[Reverse[IntegerDigits[#]]] + 1]] &]
%o A245361 (PARI)
%o A245361 revint(n) = eval(concat(Vecrev(Str(n))))
%o A245361 select(n->issquare(revint(n)+1), vector(4000, n, n)) \\ _Colin Barker_, Jul 20 2014
%Y A245361 Cf. A000290, A061230, A061457, A167217.
%K A245361 nonn,base
%O A245361 1,1
%A A245361 _K. D. Bajpai_, Jul 18 2014