A134360 -id:A134360 - cp's OEIS frontend

A087807 Prime factors of solutions to 24^n == 1 (mod n).

23, 47, 14759, 49727, 124799, 304751, 497261, 609503, 1828507, 2685259, 10741037, 12872687, 13877879, 23462213, 23652649, 27755759, 29134267, 31908959, 53753807, 65205263, 132771091, 218148653, 341965703, 551361983, 734951759

Offset: 1

Thomas Baruchel, Oct 14 2003

Primes that divide at least one term of A014960.

Prime p is in this sequence iff the multiplicative order of 24 modulo p is the product of smaller terms of this sequence. - Max Alekseyev, May 26 2010

			A014960(12) = 2870377 = 23 * 124799

Cf. A014960, A057719, A171980, A134360, A136372, A136373, A129729, A066364.

Corrected and extended by Max Alekseyev, May 26 2010

Edited by Max Alekseyev, Nov 16 2019

A354026 Primes that divide some k dividing 4^k + 3^k (A045584).

Original entry on oeis.org

7, 379, 14407, 689431, 4235659, 41647747, 137534083, 239900179, 242121643, 349909477, 1245283747, 1478065891, 1605314383, 2500276549, 2748751303, 5618210347, 7490947129, 11236420693, 11260421089, 16948514941, 29440659361, 74163546829, 75093609319, 82188727303

Offset: 1

Max Alekseyev, May 15 2022

nonn

Prime p > 3 is in this sequence iff all prime factors of the multiplicative order of -3/4 modulo p belong to this sequence.

Cf. A023394, A045584, A066364, A087807, A129729, A134360, A171980, A354027.

S=[]; forprime(p=5,oo, f=Set(factor(znorder(Mod(-3/4,p)))[,1]); if(#setintersect(S,f)==#f, S=setunion(S,[p]); print1(p,", ")));

a(18)-a(24) from Jinyuan Wang, Jan 29 2025

cp's OEIS Frontend

A087807 Prime factors of solutions to 24^n == 1 (mod n).

Views

Author

Keywords

Comments

Examples

Crossrefs

Extensions