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.

A037434 Duplicate of A033170.

Original entry on oeis.org

1, 2, 3, 4, 5, 68, 122, 246, 397, 425, 513, 625, 696, 970, 1062, 1167, 1215, 1244, 1251
Offset: 1

Views

Author

Keywords

A281383 Triangle read by rows T(n,k) is the least integer with more than 1 digit in base n and k, such that the set of its base_n digits equals the set of its base_k digits.

Original entry on oeis.org

2, 9, 3, 4, 22, 4, 5, 7, 28, 5, 6, 36, 55, 46, 6, 49, 51, 9, 17, 68, 7, 8, 17, 64, 91, 708, 94, 8, 9, 9, 81, 11, 212, 31, 124, 9, 10, 10, 13, 213, 331, 23, 614, 158, 10, 11, 23, 124, 385, 13, 38, 145, 49, 196, 11, 12, 12, 25, 49, 289, 61, 475, 2035, 1880, 238, 12
Offset: 2

Views

Author

Michel Marcus, Jan 21 2017

Keywords

Examples

			Triangle starts:
2;
9, 3;
4, 22, 4;
5, 7, 28, 5;
6, 36, 55, 46, 6;
49, 51, 9, 17, 68, 7;
8, 17, 64, 91, 708, 94, 8;
...
		

Crossrefs

Cf. A281384 (first column).

Programs

  • PARI
    T(n, k) = my(m=min(n,k)); while (Set(digits(m, n)) != Set(digits(m,k)), m++); m;
    tabl(nn) = {for (n=2, nn, for (k=2, n, print1(T(n,k), ", ");); print(););}

Formula

T(n, n) = n.
Showing 1-2 of 2 results.