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.

A308493 Numbers k such that k in base 10 contains the same digits as k in some other base.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 13, 20, 21, 23, 31, 41, 42, 43, 46, 51, 53, 61, 62, 63, 71, 73, 81, 82, 83, 84, 86, 91, 93, 100, 101, 102, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 121, 122, 123, 131, 133, 141, 144, 151, 155, 158, 161, 166, 171, 177, 181
Offset: 1

Views

Author

Jinyuan Wang, Aug 05 2019

Keywords

Comments

Supersequence of A034294 and A307498.
This sequence is infinite because 2*10^k is a term for any k >= 0.
Also 10^k is a term when k >= 0 and so too 10^k*(10^m - 1)/9 for any k > 0 and m >= 0. - Bruno Berselli, Aug 26 2019

Examples

			k = 113 is in the sequence because the set of digits of k {1, 3} equals the set of digits of (k in base 110) = 13.
		

Crossrefs

Programs

  • PARI
    isok(k) = {my(j=Set(digits(k))); for(b=2, k+1, if((b!=10) && (Set(digits(k, b)) == j), return(1))); return(0);} \\ Michel Marcus, Aug 05 2019

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.