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.

A248209 Numbers n such that n - A007953(n) contains the same distinct digits as n.

Original entry on oeis.org

54, 243, 297, 432, 486, 621, 675, 810, 864, 1018, 1143, 1197, 1225, 1332, 1386, 1410, 1443, 1521, 1522, 1525, 1571, 1575, 1577, 1710, 1764, 1775, 1810, 1908, 1918, 1953, 1997, 2043, 2097, 2125, 2232, 2233, 2286, 2321, 2332, 2333, 2421, 2475, 2521, 2610
Offset: 1

Views

Author

Derek Orr, Oct 03 2014

Keywords

Crossrefs

Cf. A247887 (similar, with n + A007953(n)).

Programs

  • Magma
    [n: n in [1..3000] | Set(Intseq(n-&+Intseq(n))) eq Set(Intseq(n))]; // Bruno Berselli, Oct 12 2014
  • PARI
    for(n=1, 10^4, d=digits(n); if(vecsort(digits(n), , 8)==vecsort(digits(n-sumdigits(n)), , 8), print1(n, ", ")))
    
  • PARI
    is(n)=Set(digits(n))==Set(digits(n-sumdigits(n))) \\ Charles R Greathouse IV, Oct 12 2014
    

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 12 2014