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.

Showing 1-2 of 2 results.

A072484 Triangle in which the n-th row contains the n smallest numbers containing the string of digits of n in increasing order.

Original entry on oeis.org

1, 2, 12, 3, 13, 23, 4, 14, 24, 34, 5, 15, 25, 35, 45, 6, 16, 26, 36, 46, 56, 7, 17, 27, 37, 47, 57, 67, 8, 18, 28, 38, 48, 58, 68, 78, 9, 19, 29, 39, 49, 59, 69, 79, 89, 10, 100, 101, 102, 103, 104, 105, 106, 107, 108, 11, 110, 111, 112, 113, 114, 115, 116, 117, 118
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2002

Keywords

Examples

			The triangle begins
1
2 12
3 13 23
4 14 24 34
.....
The 13th row is 13,113,130,131,132,133,134,135,136,137,138,139,213
		

Crossrefs

Programs

  • Perl
    See Links section.

Formula

T(n, k) = A293869(n, k) for any n > 0 and k = 1..n. - Rémy Sigrist, Jan 29 2021

Extensions

Edited by T. D. Noe, Apr 23 2009
Example corrected by Robert Israel, Sep 25 2019
Offset changed to 1 by Rémy Sigrist, Jan 29 2021

A072485 n-th number that includes the substring [n] in its decimal expansion.

Original entry on oeis.org

1, 12, 23, 34, 45, 56, 67, 78, 89, 108, 119, 129, 213, 314, 415, 516, 617, 718, 819, 920, 1021, 1220, 1223, 1240, 1251, 1262, 1273, 1284, 1295, 1306, 1317, 1328, 1433, 1349, 1435, 1536, 1637, 1738, 1839, 1940, 2041, 2142, 2243, 2441, 2445, 2460, 2471, 2482, 2493, 2504, 2515, 2526, 2537, 2548
Offset: 1

Views

Author

Amarnath Murthy, Jul 07 2002

Keywords

Crossrefs

Leading diagonal of triangle defined in A072484.

Programs

  • Maple
    N:= 100: count:= 0: R:= {$1..N}:
    V:= Vector(N):
    for n from 1 while count < N do
      Q:= map(proc(t) local i; seq(t mod 10^i,i=1..1+ilog10(t)) end proc,
        {seq(floor(n/10^i), i=0..ilog10(n))}) intersect R;
      for m in Q do
        V[m]:= V[m]+1;
        if V[m] = m then A[m]:= n; count:= count+1 fi
      od;
    od:
    seq(A[i],i=1..N); # Robert Israel, Sep 25 2019

Extensions

Corrected and extended by Robert Israel, Sep 25 2019
Showing 1-2 of 2 results.