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.

A247887 Numbers n such that n + A007953(n) contains the same digits as n.

Original entry on oeis.org

0, 45, 100, 200, 234, 279, 300, 334, 400, 423, 433, 468, 500, 600, 612, 657, 668, 700, 800, 801, 846, 866, 900, 1000, 1009, 1134, 1179, 1216, 1223, 1303, 1323, 1368, 1446, 1512, 1557, 1612, 1669, 1701, 1746, 1761, 1890, 1900, 1935, 2000, 2023, 2034, 2079
Offset: 1

Views

Author

Derek Orr, Sep 25 2014

Keywords

Comments

A037124 is a subsequence for a(n) >= 100.
The digits do not have to appear the same number of times. - Jens Kruse Andersen, Sep 28 2014

Crossrefs

Programs

  • Magma
    [n: n in [0..3000] | Set(Intseq(n+&+Intseq(n))) eq Set(Intseq(n))]; // Bruno Berselli, Oct 09 2014
  • Mathematica
    A247887Q[k_] := Union[IntegerDigits[k + Total[#]]] == Union[#] & [IntegerDigits[k]];
    Select[Range[0, 3000], A247887Q] (* Paolo Xausa, Oct 12 2024 *)
  • PARI
    for(n=0,10^4,d=digits(n);ds=digits(n+sumdigits(n));if(vecsort(d,,8)==vecsort(ds,,8),print1(n,", ")))
    

Formula

a(n) ~ n. More specifically, a(n) - n = O(n^k * log n) with k = log 9/log 10. (This bound is not tight.) - Charles R Greathouse IV, Oct 14 2014