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.

A237605 Numbers n such that A047842(n) | n.

Original entry on oeis.org

0, 22, 777, 4444, 303300, 333333, 555555, 588588, 666666, 888688, 2032230, 5055555, 5858558, 6568588, 6868288, 7339393, 8282088, 10213223, 10311233, 10313314, 10313315, 10313316, 10313317, 10313318, 10313319, 20002200, 21322314, 21322315, 21322316, 21322317, 21322318
Offset: 1

Views

Author

Paolo P. Lava, Feb 10 2014

Keywords

Comments

Autobiographical numbers (A047841) are a subset of this sequence.
The first 3 terms which contain more than 9 copies of a digit are 666666666666, 898888888898 and 4444044404444. - Giovanni Resta, Feb 10 2014

Crossrefs

Programs

  • Maple
    P:=proc(q) local a,b,c,d,f,n,v; print(0); v:=array[0..9];
    for n from 1 to q do a:=n; for b from 0 to 9 do v[b]:=0; od;
    while a>0 do b:=a mod 10; v[b]:=v[b]+1; a:=trunc(a/10); od; a:=0;
    for b from 0 to 9 do if v[b]>0 then c:=10*v[b]+b; f:=0; d:=c;
    while d>0 do f:=f+1; d:=trunc(d/10); od; a:=a*10^f+c; fi; od;
    if type(n/a,integer) then print(n); fi; od; end: P(10^10);
  • Mathematica
    Select[Range[10^6], Mod[#, FromDigits@ Flatten[IntegerDigits /@ Flatten[ Reverse /@ Tally@ Sort@ IntegerDigits@#]]] == 0 &] (* Giovanni Resta, Feb 10 2014 *)