A024075 -id:A024075 - cp's OEIS frontend

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

6, 1, 19, 25, 2801, 43, 137257, 1201, 39331, 2101, 329554457, 2353, 16148168401, 102943, 4956001, 2882401, 38771752331201, 117307, 1899815864228857, 1129901, 11898664849, 247165843, 4561457890013486057, 5762401, 79797014141614001

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. III. (1892) 265-284.

Cf. A024075, A064078, A064079, A064080, A064081, A064082.

More terms from Vladeta Jovovic, Sep 06 2001

Definition corrected by Jerry Metzger, Nov 04 2009

A027875 a(n) = Product_{i=1..n} (7^i - 1).

Original entry on oeis.org

1, 6, 288, 98496, 236390400, 3972777062400, 467389275837235200, 384914699001548351078400, 2218956256804125934296760320000, 89542886518308517126993353029713920000

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), A027873 (q=6), A027876 (q=8), A027877 (q=9), A027878 (q=10), A027879 (q=11), A027880 (q=12).

Cf. A132035.

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

Abs@QPochhammer[7, 7, Range[0, 10]] (* Vladimir Reshetnikov, Nov 20 2015 *)
Table[Product[7^k-1,{k,n}],{n,0,10}] (* Harvey P. Dale, Jul 28 2022 *)

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

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

A057954 Number of prime factors of 7^n - 1 (counted with multiplicity).

Original entry on oeis.org

2, 5, 4, 8, 3, 8, 4, 10, 7, 8, 4, 13, 3, 9, 7, 13, 4, 12, 4, 14, 7, 9, 5, 18, 5, 8, 12, 13, 5, 14, 5, 16, 9, 8, 7, 18, 5, 9, 8, 18, 5, 15, 4, 15, 12, 9, 4, 22, 8, 11, 10, 13, 5, 18, 6, 19, 10, 9, 6, 24, 6, 11, 11, 20, 9, 17, 6, 14, 10, 18, 4, 26, 7, 10, 11, 13, 9, 17, 4, 24, 17, 12, 9, 22

Offset: 1

Patrick De Geest, Nov 15 2000

nonn

			7^8-1 = 5764800 = 2^6 * 3 * 5^2 * 1201 and a(8) = bigomega(5764800) = 6+1+2+1 = 10. - _Bernard Schott_, Feb 02 2020

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

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

Cf. A001222, A024075, A059889, A074249, A085032.

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

PrimeOmega[Table[7^n - 1, {n, 1, 30}]] (* Amiram Eldar, Feb 02 2020 *)

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

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

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

Original entry on oeis.org

2, 16, 108, 640, 5600, 36288, 264992, 1536000, 12387168, 85120000, 658519752, 3135283200, 32296336800, 216063877120, 1450340640000, 8333819904000, 77537969371008, 488237947481088, 3790563394976072, 19162214400000000, 170264753751665664, 1245495178700551680

Offset: 1

Sean A. Irvine, Oct 15 2023

nonn

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

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

Cf. A000010, A024075, A366632, A366633, A366634.

EulerPhi[7^Range[30] - 1] (* Wesley Ivan Hurt, Oct 15 2023 *)

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

A074249 a(n) = largest prime factor of 7^n-1.

Original entry on oeis.org

3, 3, 19, 5, 2801, 43, 4733, 1201, 1063, 2801, 293459, 181, 16148168401, 4733, 159871, 169553, 2767631689, 117307, 4534166740403, 4021, 11898664849, 10746341, 31479823396757, 1201, 31280679788951, 16148168401, 2583253

Offset: 1

N. J. A. Sloane, Sep 26 2002

nonn

Table of n, a(n) for n = 1..388

Cf. A006530, A024075, A057954, A059889, A085032.

Join[{1}, Table[FactorInteger[7^n - 1] [[-1, 1]], {n, 30}]] (* Vincenzo Librandi, Aug 23 2012 *)

a(n) = vecmax(factor(7^n-1)[,1]); \\ Michel Marcus, Dec 16 2017

a(n) = A006530(A024075(n)). - Michel Marcus, Dec 16 2017

More terms from Benoit Cloitre, Sep 29 2002
Terms to a(80) in b-file from Vincenzo Librandi, Aug 23 2013
a(81)-a(378) in b-file from Amiram Eldar, Feb 02 2020
a(0) removed and a(379)-a(388) in b-file added by Max Alekseyev, Apr 25 2022, Sep 11 2022

A366632 Number of distinct prime divisors of 7^n - 1.

Original entry on oeis.org

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

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

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

Cf. A024075, A001221, A057954, A059889, A074249, A218358, A366620, A366633, A366634, A366635.

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

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

a(n) = omega(7^n-1) = A001221(A024075(n)).

A366633 Number of divisors of 7^n-1.

Original entry on oeis.org

4, 10, 12, 36, 8, 60, 16, 84, 64, 80, 16, 864, 8, 160, 96, 384, 16, 640, 16, 1536, 96, 160, 32, 16128, 32, 80, 1280, 1152, 32, 3840, 32, 1728, 384, 80, 128, 18432, 32, 160, 192, 14336, 32, 7680, 16, 4608, 2048, 160, 16, 147456, 256, 640, 768, 1152, 32, 25600

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

			a(5)=8 because 7^5-1 has divisors {1, 2, 3, 6, 2801, 5602, 8403, 168061}.

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

Cf. A024075, A000005, A057954, A059889, A074249, A218358, A366632, A366634, A366635.

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

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

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

a(n) = sigma0(7^n-1) = A000005(A024075(n)).

A366634 Sum of the divisors of 7^n-1.

Original entry on oeis.org

12, 124, 780, 7812, 33624, 354640, 1704240, 18929096, 97036800, 800520192, 3958188480, 56928231360, 193778020824, 1830926384640, 11181115146240, 115997032277280, 465294239722800, 5175558387507200, 22852200371636160, 287850454432579584, 1318081737957660000

Offset: 1

Sean A. Irvine, Oct 14 2023

nonn

			a(5)=33624 because 7^5-1 has divisors {1, 2, 3, 6, 2801, 5602, 8403, 16806}.

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

Cf. A024075, A000203, A057954, A059887, A074249, A218358, A366632, A366633, A366635.

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

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

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

a(n) = sigma(7^n-1) = A000203(A024075(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)

A249435 a(1) = 0, after which one less than prime powers p^m with exponent m >= 2.

Original entry on oeis.org

0, 3, 7, 8, 15, 24, 26, 31, 48, 63, 80, 120, 124, 127, 168, 242, 255, 288, 342, 360, 511, 528, 624, 728, 840, 960, 1023, 1330, 1368, 1680, 1848, 2047, 2186, 2196, 2208, 2400, 2808, 3124, 3480, 3720, 4095, 4488, 4912, 5040, 5328, 6240, 6560, 6858, 6888, 7920, 8191, 9408, 10200, 10608, 11448

Offset: 1

Antti Karttunen, Nov 02 2014

nonn

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

One less than A025475.
Subsequence of A181062 and also a subsequence of A249433 (after the initial zero).
Union of sequences A000225, A024023, A024049, A024075, A024127, etc. without their term a(1).
Apart from the first term, subsequence of A045542.

list(lim)=my(v=List([0])); lim=lim\1+1; for(m=2,logint(lim,2), forprime(p=2,sqrtnint(lim,m), listput(v, p^m-1))); Set(v) \\ Charles R Greathouse IV, Aug 26 2015

Scheme
```
(define (A249435 n) (- (A025475 n) 1))
```

a(n) = A025475(n) - 1.

cp's OEIS Frontend

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

Views

Author

Keywords

Comments

Links

Crossrefs

Extensions

A027875 a(n) = Product_{i=1..n} (7^i - 1).

Views

Author

Keywords

Links

Crossrefs

Programs

Magma

Mathematica

PARI

Formula

A057954 Number of prime factors of 7^n - 1 (counted with multiplicity).

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Magma

Mathematica

Formula

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

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

A074249 a(n) = largest prime factor of 7^n-1.

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A366632 Number of distinct prime divisors of 7^n - 1.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A366633 Number of divisors of 7^n-1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs

Maple

Mathematica

PARI

Formula

A366634 Sum of the divisors of 7^n-1.

Views

Author

Keywords

Examples

Links

Crossrefs

Programs