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.

A291461 Kaprekar triples: q^3 = x*10^2n + y*10^n + z, with q = x + y + z and 10^n > q > 10^(n-1) (q = 1 allowed for n = 1).

Original entry on oeis.org

1, 512, 91125, 26198073, 12519490248, 20301732352, 87824421125, 93824221184, 121213882349, 128711132649, 162324571375, 171323771464, 368910352448, 19902511000000, 87782935806307, 171471879319616, 220721185826504, 470511577514952, 2977097087043793, 9063181647017784
Offset: 1

Views

Author

M. F. Hasler, Aug 24 2017

Keywords

Crossrefs

Cf. A006887.

Programs

  • PARI
    m=10; for(q=1,1e4,if(qA006887 for slightly more efficient code.

Formula

a(n) = A006887(n)^3.