A228768 -id:A228768 - cp's OEIS frontend

A346113 Base-10 numbers k whose number of divisors equals the number of divisors in R(k), where k is written in all bases from base-2 to base-10 and R(k), the digit reversal of k, is read as a number in the same base.

1, 9077, 10523, 10838, 30182, 58529, 73273, 77879, 83893, 244022, 303253, 303449, 304853, 329893, 332249, 334001, 334417, 335939, 336083, 346741, 374617, 391187, 504199, 512695, 516982, 595274, 680354, 687142, 758077, 780391, 792214, 854669, 946217, 948539, 995761, 1008487, 1377067, 1389341

Offset: 1

Scott R. Shannon, Jul 05 2021

There are 633 terms below 50 million and 1253 terms below 100 million. All of those have tau(k), the number of divisors of k, equal to 1, 2, 4, 8 or 16. The first term where tau(k) = 2 is n = 93836531, a prime, which is also the first term of A136634. All terms in A136634 will appear in this sequence, as will all terms in A228768(n) for n>=10. The first term with tau(k) = 4 is 9077, the first with tau(k) = 8 is 595274, and the first with tau(k) = 16 is 5170182. It is possible tau(k) must equal 2^i, with i>=0, although this is unknown.

All known terms are squarefree. - Michel Marcus, Jul 07 2021

			9077 is a term as the number of divisors of 9077 = tau(9077) = 4, and this equals the number of divisors of R(9077) when written and then read as a base-j number, with 2 <= j <= 10. See the table below for k = 9077.
.
  base | k_base         | R(k_base)      | R(k_base)_10  | tau(R(k_base)_10)
----------------------------------------------------------------------------------
   2   | 10001101110101 | 10101110110001 | 11185         | 4
   3   | 110110012      | 210011011      | 15421         | 4
   4   | 2031311        | 1131302        | 6002          | 4
   5   | 242302         | 203242         | 6697          | 4
   6   | 110005         | 500011         | 38887         | 4
   7   | 35315          | 51353          | 12533         | 4
   8   | 21565          | 56512          | 23882         | 4
   9   | 13405          | 50431          | 33157         | 4
  10   | 9077           | 7709           | 7709          | 4

Scott R. Shannon, Table of n, a(n) for n = 1..1253

Cf. A000005, A004086.
Cf. A030102, A030103, A030104, A030105, A030106, A030107, A030108.
Cf. A136634 (prime terms), A228768.
Subsequence of A062895.

Select[Range@100000,Length@Union@DivisorSigma[0,Join[{s=#},FromDigits[Reverse@IntegerDigits[s,#],#]&/@Range[2,10]]]==1&] (* Giorgos Kalogeropoulos, Jul 06 2021 *)

isok(k) = {my(t= numdiv(k)); for (b=2, 10, my(d=digits(k, b)); if (numdiv(fromdigits(Vecrev(d), b)) != t, return (0));); return(1);} \\ Michel Marcus, Jul 06 2021

A331486 Numbers k which are emirps in more bases 1 < b < k than any previous number.

Original entry on oeis.org

2, 5, 7, 11, 13, 17, 23, 29, 31, 41, 43, 53, 67, 73, 79, 97, 113, 127, 157, 193, 223, 269, 277, 311, 379, 421, 431, 467, 487, 563, 613, 647, 743, 907, 937, 977, 1093, 1193, 1249, 1259, 1373, 1483, 1543, 1637, 1667, 1933, 2239, 2393, 2477, 2521, 2857, 2957, 3083

Offset: 1

Amiram Eldar, Jan 23 2020

The corresponding numbers of bases are 0, 1, 3, 6, 8, 9, 12, 13, 17, 21, 24, ... (see the link for more values).

			2 is not emirp in any base.
5 is emirp in one base, 3: 5 is 12 in base 3, and 21 in base 3 is 7 which is also a prime.
7 is emirp in 3 bases, 3, 4, and 5.

Amiram Eldar, Table of n, a(n) for n = 1..175
Amiram Eldar, Table of n, a(n), number of bases for n = 1..175

Cf. A006567, A080790, A087911, A107129, A228768.

emirpQ[n_, b_] := n != (rev = FromDigits[Reverse @ IntegerDigits[n, b], b]) && And @@ PrimeQ[{n, rev}];
emirpCount[n_] := Length @ Select[Range[2, n - 1], emirpQ[n, #] &];
seq = {}; emax = -1; Do[e1 = emirpCount[n]; If[e1 > emax, emax = e1; AppendTo[seq, n]], {n, 2, 3000}]; seq

A344512 a(n) is the least number larger than 1 which is a self number in all the bases 2 <= b <= n.

Original entry on oeis.org

4, 13, 13, 13, 287, 287, 2971, 2971, 27163, 27163, 90163, 90163, 5940609, 5940609, 6069129, 6069129, 276404649, 276404649

Offset: 2

Amiram Eldar, May 21 2021

Since the sequence of base-b self numbers for odd b is the sequence of the odd numbers (A005408) (Joshi, 1973), all the terms beyond a(2) are odd numbers.
For the corresponding sequence with only even bases, see A344513.
a(20) > 1.5*10^10, if it exists.

			a(2) = 4 since the least binary self number after 1 is A010061(2) = 4.
a(3) = 13 since the least binary self number after 1 which is also a self number in base 3 is A010061(4) = 13.

Vijayshankar Shivshankar Joshi, Contributions to the theory of power-free integers and self-numbers, Ph.D. dissertation, Gujarat University, Ahmedabad (India), October, 1973.
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, p. 384-386.

Eric Weisstein's World of Mathematics, Self Number.
Wikipedia, Self number.
Index entries for Colombian or self numbers and related sequences

Cf. A003052, A010061, A010064, A010067, A010070, A339211, A339212, A339213, A339214, A339215, A342729, A344513.

Similar sequences: A016038, A217705, A225427, A226320, A228768, A258107.

s[n_, b_] := n + Plus @@ IntegerDigits[n, b]; selfQ[n_, b_] := AllTrue[Range[n, n - (b - 1) * Ceiling @ Log[b, n], -1], s[#, b] != n &]; a[2] = 4; a[b_] := a[b] = Module[{n = a[b - 1]}, While[! AllTrue[Range[2, b], selfQ[n, #] &], n++]; n]; Array[a, 10, 2]

a(2*n+1) = a(2*n) for n >= 2.

A344513 a(n) is the least number larger than 1 which is a self number in all the even bases b = 2*k for 1 <= k <= n.

Original entry on oeis.org

4, 13, 287, 294, 6564, 90163, 1136828, 3301262, 276404649, 5643189146

Offset: 1

Amiram Eldar, May 21 2021

Joshi (1973) proved that for all odd b the sequence of base-b self numbers is the sequence of odd numbers (A005408). Therefore, in this sequence the bases are restricted to even values. For the corresponding sequence with both odd and even bases, see A344512.

			a(1) = 4 since the least binary self number after 1 is A010061(2) = 4.
a(2) = 13 since the least binary self number after 1 which is also a self number in base 2*2 = 4 is A010061(4) = A010064(4) = 13.

Vijayshankar Shivshankar Joshi, Contributions to the theory of power-free integers and self-numbers, Ph.D. dissertation, Gujarat University, Ahmedabad (India), October, 1973.
József Sándor and Borislav Crstici, Handbook of Number theory II, Kluwer Academic Publishers, 2004, Chapter 4, p. 384-386.

Eric Weisstein's World of Mathematics, Self Number.
Wikipedia, Self number.
Index entries for Colombian or self numbers and related sequences

Cf. A003052, A010061, A010064, A010067, A010070, A339211, A339212, A339213, A339214, A339215, A342729, A344512.

Similar sequences: A016038, A217705, A225427, A226320, A228768, A258107.

s[n_, b_] := n + Plus @@ IntegerDigits[n, b]; selfQ[n_, b_] := AllTrue[Range[n, n - (b - 1) * Ceiling @ Log[b, n], -1], s[#, b] != n &]; a[1] = 4; a[n_] := a[n] = Module[{k = a[n - 1]}, While[! AllTrue[Range[1, n], selfQ[k, 2*#] &], k++]; k]; Array[a, 7]

A359113 a(n) counts the bases b in the interval 2 to p = prime(n), where p if written in base b gives again a prime number in base b if all digits are written in reverse order.

Original entry on oeis.org

0, 1, 3, 5, 7, 10, 12, 9, 14, 15, 20, 19, 23, 26, 24, 33, 22, 30, 38, 36, 40, 39, 38, 33, 54, 49, 43, 52, 37, 60, 65, 53, 59, 57, 50, 52, 85, 52, 79, 76, 57, 77, 69, 103, 90, 83, 84, 106, 80, 68, 90, 85, 89, 94, 75, 100, 108, 87, 128, 97, 119, 99, 118, 139, 105, 96

Offset: 1

Thomas Scheuerle, Jan 07 2023

Let p' be p with digit reversal in base b. If p' is composite then all multiplication operations c * d = p' in base b of integers c,d > 1 are using carry in long multiplication. For A000040(n) this is the case in A000040(n) - (a(n)+1) bases.
If a(n) is a record in this sequence, then A000040(n) is in A331486.
Prime indices of numbers in A228768 are also among the indices of the records in the rational number sequence a(n)/(n-1) with n > 1. See also the plot of this sequence in the link section.

			a(3) = 3:
  prime(3) = 5 in bases 2..5:
  5 = 101_2; reversing digits gives 101_2 = 5 (prime).
  5 =  12_3; reversing digits gives  21_3 = 7 (prime).
  5 =  11_4; reversing digits gives  11_4 = 5 (prime).
  5 =  10_5; reversing digits gives  01_5 = 1 (nonprime).

Thomas Scheuerle, Table of n, a(n) for n = 1..4000
Thomas Scheuerle, Scatterplot a(n)/(n-1) for the first 2000 values. Will this quotient remain inside the interval 1..2.5 for any n? For n = 2..2000 a mean value of approximately 1.65... (orange line in plot) was observed.
Rémy Sigrist, Scatterplot of (n, b) such that the reversal of prime(n) in base b gives a prime number with n, b <= 2000 and 2 <= b <= prime(n)

Cf. A000040, A007500, A002385, A135551, A228768, A331486.

revprime(p, b)=my(q, t=p); while(t, q=b*q+t%b; t\=b); isprime(q)
a(n) = sum(b = 2, prime(n), revprime(prime(n), b))

a(n) >= A135551(A000040(n)).

cp's OEIS Frontend

A346113 Base-10 numbers k whose number of divisors equals the number of divisors in R(k), where k is written in all bases from base-2 to base-10 and R(k), the digit reversal of k, is read as a number in the same base.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A331486 Numbers k which are emirps in more bases 1 < b < k than any previous number.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

A344512 a(n) is the least number larger than 1 which is a self number in all the bases 2 <= b <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

Formula

A344513 a(n) is the least number larger than 1 which is a self number in all the even bases b = 2*k for 1 <= k <= n.

Views

Author

Keywords

Comments

Examples

References

Links

Crossrefs

Programs

Mathematica

A359113 a(n) counts the bases b in the interval 2 to p = prime(n), where p if written in base b gives again a prime number in base b if all digits are written in reverse order.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

PARI

Formula