A024062 -id:A024062 - cp's OEIS frontend

A064082 Zsigmondy numbers for a = 6, b = 1: Zs(n, 6, 1) is the greatest divisor of 6^n - 1^n (A024062) that is relatively prime to 6^m - 1^m for all positive integers m < n.

5, 7, 43, 37, 311, 31, 55987, 1297, 46873, 1111, 72559411, 1261, 2612138803, 5713, 1406371, 1679617, 3385331888947, 46441, 121871948002099, 1634221, 1822428931, 51828151, 157946044610720563, 1678321, 731325737104301

Offset: 1

Jens Voß, Sep 04 2001

nonn

By Zsigmondy's theorem, the n-th Zsigmondy number for bases a and b is not 1 except in the three cases (1) a = 2, b = 1, n = 1, (2) a = 2, b = 1, n = 6, (3) n = 2 and a+b is a power of 2.

K. Zsigmondy, Zur Theorie der Potenzreste, Monatsh. f. Math. 3 (1892) 265-284.

Cf. A024062, A064078, A064079, A064080, A064081, A064083.

More terms from Vladeta Jovovic, Sep 06 2001

Definition corrected by Jerry Metzger, Nov 04 2009

A027873 a(n) = Product_{i=1..n} (6^i - 1).

Original entry on oeis.org

1, 5, 175, 37625, 48724375, 378832015625, 17674407688984375, 4947685316415841015625, 8310206472731792807458984375, 83747726219216824716765369541015625

Offset: 0

N. J. A. Sloane

nonn

G. C. Greubel, Table of n, a(n) for n = 0..50

Cf. A005329 (q=2), A027871 (q=3), A027637 (q=4), A027872 (q=5), A027875 (q=7), A027876 (q=8), A027877 (q=9), A027878 (q=10), A027879 (q=11), A027880 (q=12).

Cf. A132034.

[1] cat [&*[ 6^k-1: k in [1..n] ]: n in [1..11]]; // Vincenzo Librandi, Dec 24 2015

Table[Product[(6^k-1),{k,1,n}],{n,0,20}] (* Vaclav Kotesovec, Jul 17 2015 *)
Abs@QPochhammer[6, 6, Range[0, 10]] (* Vladimir Reshetnikov, Nov 20 2015 *)
FoldList[Times,Join[{1},6^Range[10]-1]] (* Harvey P. Dale, Oct 13 2017 *)

a(n) = prod(i=1, n, 6^i-1); \\ Michel Marcus, Nov 21 2015

5^n|a(n) for n>=0. - G. C. Greubel, Nov 20 2015
a(n) ~ c * 6^(n*(n+1)/2), where c = Product_{k>=1} (1-1/6^k) = A132034 = 0.805687728162164940923750215496298968917997628693... . - Vaclav Kotesovec, Nov 21 2015
a(n) = 6^(binomial(n+1,2))*(1/6;1/6){n}, where (a;q){n} is the q-Pochhammer symbol. - G. C. Greubel, Dec 24 2015
a(n) = Product_{i=1..n} A024062(i). - Michel Marcus, Dec 27 2015
G.f.: Sum_{n>=0} 6^(n*(n+1)/2)*x^n / Product_{k=0..n} (1 + 6^k*x). - Ilya Gutkovskiy, May 22 2017
Sum_{n>=0} (-1)^n/a(n) = A132034. - Amiram Eldar, May 07 2023

A057955 Number of prime factors of 6^n - 1 (counted with multiplicity).

Original entry on oeis.org

1, 2, 2, 3, 3, 4, 2, 4, 4, 6, 3, 7, 3, 6, 6, 6, 5, 7, 3, 9, 4, 5, 5, 9, 6, 7, 6, 9, 2, 11, 3, 9, 6, 8, 7, 13, 6, 6, 6, 12, 3, 10, 5, 9, 11, 8, 4, 13, 5, 10, 9, 11, 4, 11, 7, 14, 7, 6, 4, 20, 4, 5, 10, 12, 9, 12, 3, 11, 8, 18, 2, 18, 5, 10, 12, 9, 6, 15, 4, 17, 8, 7, 8, 17, 10, 7, 7, 12, 4, 18, 6

Offset: 1

Patrick De Geest, Nov 15 2000

nonn

			6^10 - 1 = 60466175 = 5^2 * 7 * 11 * 101 * 311 and a(10) = bigomega(60466175) = 2+1+1+1+1 = 6. - _Bernard Schott_, Feb 02 2020

Max Alekseyev, Table of n, a(n) for n = 1..430 (terms 1..420 from Amiram Eldar)
S. S. Wagstaff, Jr., The Cunningham Project

bigomega(b^n-1): A057951 (b=10), A057952 (b=9), A057953 (b=8), A057954 (b=7), this sequence (b=6), A057956 (b=5), A057957 (b=4), A057958 (b=3), A046051 (b=2).

Cf. A001222, A024062, A085031, A274907.

f:=func; [f(6^n - 1):n in [1..90]]; // Marius A. Burtea, Feb 02 2020

PrimeOmega[6^Range[100]-1] (* Harvey P. Dale, Dec 14 2015 *)

Möbius transform of A085031. - T. D. Noe, Jun 19 2003

a(n) = A001222(A024062(n)). - Amiram Eldar, Feb 02 2020

A014946 Numbers k that divide 6^k-1.

Original entry on oeis.org

1, 5, 25, 125, 625, 1555, 3125, 7775, 15625, 38875, 78125, 194375, 390625, 483605, 971875, 1953125, 2418025, 4859375, 9673655, 9765625, 12090125, 24296875, 48368275, 48828125, 60450625, 120909025, 121484375, 150401155, 241841375

Offset: 1

Olivier Gérard

nonn

Includes all powers of 5. If a term such as 1555 = 5*311 occurs, so does any number of the form 5^a * 311^b for a>3.
From Alexander Adamchuk, May 16 2010: (Start)
All terms that are not powers of 5 are divisible by 5 and 311.
Prime divisors of a(n) are {5, 311, 6221, 15551, 155501, ...}. (End)

Cf. A024062 (6^n-1).

Select[ Range[ 5*10^7], PowerMod[6, #, # ] == 1 & ]

is(n)=Mod(6,n)^n==1 \\ Charles R Greathouse IV, Nov 04 2016

Better description from Benoit Cloitre, Mar 06 2002
Edited and extended by Robert G. Wilson v, Jun 18 2002
a(25)-a(45) from Alexander Adamchuk, May 16 2010

A366623 a(n) = phi(6^n-1), where phi is Euler's totient function (A000010).

Original entry on oeis.org

4, 24, 168, 864, 6200, 30240, 223944, 1119744, 7457184, 37200000, 277618528, 1254113280, 10445497920, 51618196224, 365601600000, 1770091315200, 13439285266176, 62336092492800, 484935499902880, 2179146240000000, 17141125020596640, 86330728271779200

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..430

phi(k^n-1): A053287 (k=2), A295500 (k=3), A295501 (k=4), A295502 (k=5), this sequence (k=6), A366635 (k=7), A366654 (k=8), A366663 (k=9), A295503 (k=10), A366685 (k=11), A366711 (k=12).

Cf. A024062, A000010, A295502, A366620, A366621, A366622.

EulerPhi[6^Range[22] - 1] (* Paul F. Marrero Romero, Oct 23 2023 *)

PARI
```
{a(n) = eulerphi(6^n-1)}
```

a(n) = A000010(A024062(n)). - Paul F. Marrero Romero, Oct 23 2023

A366621 Number of divisors of 6^n-1.

Original entry on oeis.org

2, 4, 4, 8, 6, 16, 4, 16, 16, 48, 8, 128, 8, 48, 48, 64, 32, 128, 8, 384, 16, 32, 32, 512, 32, 128, 64, 384, 4, 1536, 8, 512, 64, 256, 96, 8192, 64, 64, 64, 3072, 8, 768, 32, 512, 1536, 256, 16, 8192, 32, 512, 512, 2048, 16, 2048, 96, 12288, 128, 64, 16

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

			a(4)=8 because 6^4-1 has divisors {1, 5, 7, 35, 37, 185, 259, 1295}.

Max Alekseyev, Table of n, a(n) for n = 1..430

Cf. A024062, A000005, A057955, A059888, A274907, A366613, A366620, A366622, A366623.

Cf. A046801, A366575, A366602, A366612, A366633, A366652, A366661, A070528, A366683, A366709.

a:=n->numtheory[tau](6^n-1):
seq(a(n), n=1..100);

Mathematica
```
DivisorSigma[0, 6^Range[100]-1]
```
PARI
```
a(n) = numdiv(6^n-1);
```

a(n) = sigma0(6^n-1) = A000005(A024062(n)).

A366622 Sum of the divisors of 6^n-1.

Original entry on oeis.org

6, 48, 264, 1824, 9672, 67584, 335928, 2367552, 13031040, 94708224, 454285152, 3523559424, 15677418768, 113738502240, 599516366592, 4210539708672, 20465720064000, 154928015278080, 735060126170880, 5906693566844928, 26937015875831424, 188358079273592832

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

			a(4)=1824 because 6^4-1 has divisors {1, 5, 7, 35, 37, 185, 259, 1295}.

Max Alekseyev, Table of n, a(n) for n = 1..430

Cf. A024062, A000203, A057955, A059888, A274907, A366620, A366621, A366623, A366629.

Cf. A075708, A366576, A366603, A366613, A366634, A366653, A366662, A102146, A366684, A366710.

a:=n->numtheory[sigma](6^n-1):
seq(a(n), n=1..100);

Mathematica
```
DivisorSigma[1, 6^Range[30]-1]
```

a(n) = sigma(6^n-1) = A000203(A024062(n)).

A366620 Number of distinct prime divisors of 6^n - 1.

Original entry on oeis.org

1, 2, 2, 3, 2, 4, 2, 4, 4, 5, 3, 7, 3, 5, 5, 6, 5, 7, 3, 8, 4, 5, 5, 9, 4, 7, 6, 8, 2, 10, 3, 9, 6, 8, 6, 13, 6, 6, 6, 11, 3, 9, 5, 9, 10, 8, 4, 13, 5, 8, 9, 11, 4, 11, 6, 13, 7, 6, 4, 19, 4, 5, 10, 12, 8, 12, 3, 11, 8, 16, 2, 18, 5, 10, 10, 9, 6, 15, 4, 16, 8

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

Max Alekseyev, Table of n, a(n) for n = 1..430

Cf. A024062, A001221, A057955, A059888, A274907, A366621, A366622, A366623.

Cf. A046800, A133801, A366604, A366611, A366632, A366651, A366660, A102347, A366681, A366707.

for(n = 1, 100, print1(omega(6^n - 1), ", "))

a(n) = omega(6^n-1) = A001221(A024062(n)).

A024140 a(n) = 12^n - 1.

Original entry on oeis.org

0, 11, 143, 1727, 20735, 248831, 2985983, 35831807, 429981695, 5159780351, 61917364223, 743008370687, 8916100448255, 106993205379071, 1283918464548863, 15407021574586367, 184884258895036415

Offset: 0

N. J. A. Sloane

In base 12 these are 0, B, BB, BBB, ... . - David Rabahy, Dec 12 2016

Index entries for linear recurrences with constant coefficients, signature (13,-12).

Cf. A001021, A016125, A178248.

Cf. Similar sequences of the type k^n-1: A000004 (k=1), A000225 (k=2), A024023 (k=3), A024036 (k=4), A024049 (k=5), A024062 (k=6), A024075 (k=7), A024088 (k=8), A024101 (k=9), A002283 (k=10), A024127 (k=11), this sequence (k=12).

12^Range[0,20]-1 (* or *) LinearRecurrence[{13,-12},{0,11},20] (* Harvey P. Dale, Feb 01 2019 *)

From Mohammad K. Azarian, Jan 14 2009: (Start)
G.f.: 1/(1-12*x) - 1/(1-x).
E.g.f.: exp(12*x) - exp(x). (End)
a(n) = 12*a(n-1) + 11 for n>0, a(0)=0. - Vincenzo Librandi, Nov 18 2010
a(n) = Sum_{i=1..n} 11^i*binomial(n,n-i) for n>0, a(0)=0. - Bruno Berselli, Nov 11 2015
From Elmo R. Oliveira, Dec 15 2023: (Start)
a(n) = 13*a(n-1) - 12*a(n-2) for n>1.
a(n) = A001021(n)-1 = A178248(n)-2.
a(n) = 11*(A016125(n) - 1)/12. (End)

A274907 Largest prime factor of 6^n - 1.

Original entry on oeis.org

5, 7, 43, 37, 311, 43, 55987, 1297, 2467, 311, 3154757, 97, 760891, 55987, 1201, 98801, 30839, 46441, 638073026189, 6781, 1822428931, 51828151, 7505944891, 1678321, 40185601, 760891, 623067280651, 5030761, 7369130657357778596659, 1950271, 49744740983476472807

Offset: 1

Vincenzo Librandi, Jul 11 2016

nonn

			6^5 - 1 = 7775 = 5*5*311, so a(5) = 311.

Max Alekseyev, Table of n, a(n) for n = 1..430 (terms 1..100 from Vincenzo Librandi, term 101..420 from Amiram Eldar)
J. Brillhart et al., Factorizations of b^n +- 1, Contemporary Mathematics, Vol. 22, Amer. Math. Soc., Providence, RI, 3rd edition, 2002.

Cf. A006530, A057955, A059888, A085031, A024062, A366620, A366621, A366622, A366623.

Cf. similar sequences listed in A274906.

[Maximum(PrimeDivisors(6^n-1)): n in [1..40]];

Table[FactorInteger[6^n - 1][[-1, 1]], {n, 40}]

a(n) = vecmax(factor(6^n-1)[,1]); \\ Michel Marcus, Jul 13 2016

a(n) = A006530(A024062(n)). - Michel Marcus, Jul 11 2016

cp's OEIS Frontend

A064082 Zsigmondy numbers for a = 6, b = 1: Zs(n, 6, 1) is the greatest divisor of 6^n - 1^n (A024062) that is relatively prime to 6^m - 1^m for all positive integers m < n.

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A027873 a(n) = Product_{i=1..n} (6^i - 1).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A057955 Number of prime factors of 6^n - 1 (counted with multiplicity).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

A014946 Numbers k that divide 6^k-1.

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Extensions

A366623 a(n) = phi(6^n-1), where phi is Euler's totient function (A000010).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A366621 Number of divisors of 6^n-1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A366622 Sum of the divisors of 6^n-1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

Formula

A366620 Number of distinct prime divisors of 6^n - 1.

Views

Author

Keywords

Links

Crossrefs