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.

A258382 Non-palindromic numbers n such that the square root of n multiplied by the reversal of n is a palindrome.

Original entry on oeis.org

144, 441, 1584, 4851, 10404, 12544, 14544, 14884, 15984, 27648, 40401, 44521, 44541, 48841, 48951, 84672, 114444, 137984, 144144, 159984, 409739, 441441, 444411, 489731, 489951, 937904, 1004004, 1022121, 1024144, 1042441, 1044484, 1050804
Offset: 1

Views

Author

Pieter Post, May 28 2015

Keywords

Comments

This sequence is infinite, because it contains several infinite subsequences such as: sqrt(1584*4851)=2772, sqrt(15984*48951)=27972, sqrt(159..984*489...951)=279...972.
It appears that the first (or last) digit is never 5, 6 or 7.

Examples

			27648 is in the sequence because sqrt(27648*84672)=48384.
		

Crossrefs

Programs

  • Mathematica
    palQ[n_] := Block[{d = IntegerDigits@ n}, And[IntegerQ@ n, d == Reverse@ d]]; Select[Range@ 100000, And[! palQ@ #, palQ[Sqrt[# FromDigits@ Reverse@ IntegerDigits@ #]]] &] (* Michael De Vlieger, May 28 2015 *)
  • PARI
    rev(k) = subst(Polrev(digits(k)), x, 10);
    isok(n) = {rn = rev(n); if (rn != n, nrn = n*rn; issquare(nrn) && (y=sqrtint(nrn)) && (y == rev(y)););} \\ Michel Marcus, May 29 2015
  • Python
    for n in range (1, 10**9):
        y=int(str(n)[::-1])
        ya=int(pow(n*y,1/2))
        if ya==int(str(ya)[::-1]) and n*y==ya**2 and n!=y:
            print (n)
    

Formula

Numbers n such that sqrt(n*reversal(n)) is a palindrome, where n is not a palindrome.