A358978 -id:A358978 - cp's OEIS frontend

A358977 Numbers that are coprime to the sum of their primorial base digits (A276150).

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 26, 29, 30, 31, 34, 35, 37, 38, 39, 41, 43, 46, 47, 49, 53, 54, 55, 57, 58, 59, 61, 62, 63, 67, 69, 71, 73, 74, 78, 79, 81, 82, 83, 85, 86, 87, 89, 91, 93, 94, 95, 97, 98, 101, 102, 103, 106, 107, 109, 110

Offset: 1

Amiram Eldar, Dec 07 2022

Numbers k such that gcd(k, A276150(k)) = 1.
The primorial numbers (A002110) are terms. These are also the only primorial base Niven numbers (A333426) in this sequence.
Includes all the prime numbers.
The numbers of terms not exceeding 10^k, for k = 1, 2, ..., are 7, 59, 603, 6047, 60861, 608163, 6079048, 60789541, 607847981, 6080015681... . Conjecture: The asymptotic density of this sequence exists and equals 6/Pi^2 = 0.607927... (A059956), the same as the density of A094387.

			3 is a term since A276150(3) = 2, and gcd(3, 2) = 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A059956, A276150, A333426.
Subsequences: A000040, A002110.
Similar sequences: A094387, A339076, A358975, A358976, A358978.

With[{max = 4}, bases = Prime@Range[max, 1, -1]; nmax = Times @@ bases - 1; sumdig[n_] := Plus @@ IntegerDigits[n, MixedRadix[bases]]; Select[Range[nmax], CoprimeQ[#, sumdig[#]] &]]

is(n) = {my(p=2, s=0, m=n, r); while(m>0, r = m%p; s+=r; m\=p; p = nextprime(p+1)); gcd(n, s)==1; }

A358975 Numbers that are coprime to their digital sum in base 3 (A053735).

Original entry on oeis.org

1, 3, 5, 7, 9, 11, 13, 17, 19, 23, 27, 29, 31, 37, 41, 43, 47, 49, 51, 53, 55, 59, 61, 67, 69, 71, 73, 79, 81, 83, 85, 89, 91, 97, 101, 103, 107, 109, 113, 119, 121, 123, 125, 127, 129, 131, 137, 139, 141, 143, 147, 149, 151, 153, 155, 157, 159, 161, 163, 167, 169

Offset: 1

Amiram Eldar, Dec 07 2022

Numbers k such that gcd(k, A053735(k)) = 1.
All the terms are odd since if k is even then A053735(k) is even and so gcd(k, A053735(k)) >= 2.
Olivier (1975, 1976) proved that the asymptotic density of this sequence is 4/Pi^2 = 0.40528... (A185199).
The powers of 3 (A000244) are terms. These are also the only ternary Niven numbers (A064150) in this sequence.
Includes all the odd prime numbers (A065091).

			3 is a term since A053735(3) = 1, and gcd(3, 1) = 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Christian Mauduit, Carl Pomerance, and András Sárközy, On the distribution in residue classes of integers with a fixed sum of digits, The Ramanujan Journal, Vol. 9, No. 1-2 (2005), pp. 45-62; alternative link.
Michel Olivier, Sur la probabilité que n soit premier à la somme de ses chiffres, C. R. Math. Acad. Sci. Paris, Série A, Vol. 280 (1975), pp. 543-545.
Michel Olivier, Fonctions g-additives et formule asymptotique pour la propriété (n, f(n)) = q, Acta Arithmetica, Vol. 31, No. 4 (1976), pp. 361-384; alternative link.

Cf. A064150, A053735, A185199, A332880.
Subsequences: A000244, A065091.
Similar sequences: A094387, A339076, A358976, A358977, A358978.

q[n_] := CoprimeQ[n, Plus @@ IntegerDigits[n, 3]]; Select[Range[200], q]

PARI
```
is(n) = gcd(n, sumdigits(n, 3)) == 1;
```

A358976 Numbers that are coprime to the sum of their factorial base digits (A034968).

Original entry on oeis.org

1, 2, 3, 5, 6, 7, 10, 11, 13, 14, 15, 17, 19, 21, 22, 23, 24, 25, 28, 29, 31, 32, 33, 37, 39, 41, 43, 44, 47, 49, 50, 51, 53, 55, 57, 58, 59, 61, 62, 65, 66, 67, 69, 71, 73, 76, 77, 79, 83, 84, 85, 87, 88, 89, 92, 93, 95, 97, 98, 101, 102, 103, 106, 107, 109, 110

Offset: 1

Amiram Eldar, Dec 07 2022

Numbers k such that gcd(k, A034968(k)) = 1.
The factorial numbers (A000142) are terms. These are also the only factorial base Niven numbers (A118363) in this sequence.
Includes all the prime numbers.
The numbers of terms not exceeding 10^k, for k = 1, 2, ..., are 7, 59, 601, 6064, 60729, 607567, 6083420, 60827602, 607643918, 6079478119, ... . Conjecture: The asymptotic density of this sequence exists and equals 6/Pi^2 = 0.607927... (A059956), the same as the density of A094387.

			3 is a term since A034968(3) = 2, and gcd(3, 2) = 1.

Amiram Eldar, Table of n, a(n) for n = 1..10000

Cf. A034968, A059956, A118363.
Subsequences: A000040, A000142.
Similar sequences: A094387, A339076, A358975, A358977, A358978.

q[n_] := Module[{k = 2, s = 0, m = n, r}, While[m > 0, r=Mod[m,k]; s+=r; m=(m-r)/k; k++]; CoprimeQ[n, s]]; Select[Range[120], q]

is(n)={my(k=2, s=0, m=n); while(m>0, s+=m%k; m\=k; k++); gcd(s,n)==1;}

cp's OEIS Frontend

A358977 Numbers that are coprime to the sum of their primorial base digits (A276150).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A358975 Numbers that are coprime to their digital sum in base 3 (A053735).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

A358976 Numbers that are coprime to the sum of their factorial base digits (A034968).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI