cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Showing 1-4 of 4 results.

A140258 Minimal multiples from A016089 of primes from A129729.

Original entry on oeis.org

2, 6, 1926, 2471058, 38259378, 41218326, 600917778, 114130755846, 600929334, 28312987734, 342397209654, 722113254, 15559317470256498, 84332966140854, 20543988255894, 1314244621926, 600935058, 6739452314987202
Offset: 1

Views

Author

Max Alekseyev, May 16 2008

Keywords

Comments

A016089 lists numbers n such that n divide n-th Lucas number A000032(n) while A129729 lists all possible prime divisors of elements of A016089 in the increasing order. This sequence lists minimal multiples from A016089 of primes from A129729.

Formula

a(n) = min { A016089(m) : A129729(n)|A016089(m) }

A171980 Prime divisors of elements of A129066.

Original entry on oeis.org

5, 3001, 120041, 532501, 720241, 2160721, 3937501, 9375001, 16505501, 120040001, 158453021, 165055001, 202567501, 289312501, 562500061, 900307501, 985937501, 1500512501, 1512504701, 3169060421, 3301100021, 3908604433, 3993757501
Offset: 1

Views

Author

Max Alekseyev, Jan 20 2010

Keywords

Comments

Corresponding smallest multiples from A129066 are given in A171981.
Prime p>5 is in this sequence if the multiplicative order of (sqrt(5)-3)/2 modulo p is the product of smaller terms of this sequence.

Links

Crossrefs

Cf. A057719, A066364, A129729, A171981

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

Original entry on oeis.org

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

Views

Author

Thomas Baruchel, Oct 14 2003

Keywords

Comments

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

Examples

			A014960(12) = 2870377 = 23 * 124799

Crossrefs

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

Extensions

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

Views

Author

Max Alekseyev, May 15 2022

Keywords

Comments

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

Crossrefs

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

Programs

  • PARI
    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,", ")));

Extensions

a(18)-a(24) from Jinyuan Wang, Jan 29 2025
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.