Files

aliquot-sequences
can-you-find
cgi-projects
chess-bot
cicada-3301
diacritix
factordb
factorization-reports
factorizations
gnfs
highly-composite-numbers
img2text
lixmaker
oeis-drafts
oeis-research
- Ahmad J. Masad
- Albert Böschow
- Alex Costea
- Alex Ratushnyak
- Alexander Adamchuk
- Alexander R. Povolotsky
- Altug Alkan
- Amarnath Murthy
- Amiram Eldar
- Antti Karttunen
- Arkadiusz Wesolowski
- Arsen Vardanyan
- Artsiom Palkounikau
- Artur Jasinski
- Benoit Cloitre
- Bernard Schott
- Bodo Zinser
- Brad Clardy
- Chai Wah Wu
- Charles Marsden
- Charles R Greathouse IV
- Charles T. Le
- Charlie Neder
- Cino Hilliard
- Clark Kimberling
- Claude H. R. Dequatre
- Claudio Meller
- Colin Barker
- Ctibor O. Zizka
- César Aguilera
- Daniel Hoya
- Daniel Lignon
- Daniel Suteu
  - Added edits
  - Agrawal's conjecture pseudoprimes
  - Alternating sum of the Mertens function
  - Carmichael numbers k such that k+1 is divisible by gpf(k)+1
  - Carmichael numbers k where records occur for gcd(k-1, lambda(k))
  - Carmichael numbers n where records occur for gpf(n) divided by lpf(n)
  - Carmichael numbers n where records occur for lpf(n) divided by gpf(n)
  - Carmichael-Lucas-Carmichael almost numbers
  - Chernick-Carmichael numbers with 4 or more prime factors
  - Chernick-Carmichael numbers with k factors
  - Chernick-Carmichael numbers
  - Cubic recurence sequence
  - Difference of 0's and 1's in middle of binary digits
  - Digit scrambling sequences
  - Dirichlet convolution of 2^omega(n)*mu(n)^2 with the positive integers
  - Emirps
  - Factor sequences
  - Fast PARI program with moebius
  - Fermat factors
  - Fermat pseudoprimes of the form p*((p-1)*n + 1)
  - First number k such that k + a(i) has n distinct prime factors, for all i < n
  - First number k such that k + a(i) is the product of n distinct prime factors, for all i < n
  - First number k such that the concatenation of a(i) and k has n distinct prime factors, for all i < n
  - First number k such that the concatenation of a(i) and k has n prime factors, counted with multiplicity, for all i < n
  - First number k such that the concatenation of k and a(i) has n distinct prime factors, for all i < n
  - First number k such that the concatenation of k and a(i) has n prime factors, counted with multiplicity, for all i < n
  - Generalized class of primes
  - Incrementally largest numbers n that are the product of primes p such that p+1 divides n
  - Irregular triangle read by rows of integers k such that n AND k != k, for k = 1..n
  - Irregular triangle read by rows of integers k such that n AND k = k, for k = 1..n
  - Large smooth semiprime
  - Least non-palindromic number k such that k and its digital reversal both are the product of n distinct primes
  - Least number k such that A002277(k) has exactly n distinct prime factors
  - Least prime p such that 2*x*(2*x+1) + p produces primes for x=0..n-1 and composite for x=n
  - Least prime p such that x*(x+1)*(x+2) + p produces primes for x=0..n-1 and composite for x=n
  - Limit for pi ÷ 4
  - Liouville sum
  - Moebius transform of dedekind
  - Number k such that tau(k) equals the number of solutions to sigma(x) = k
  - Number of distinct prime factors of sigma(sigma_n(n))
  - Number of primes factors of the n-th n-powerful number
  - Numbers k such that (prime(k) - composite(k)) == 0 (mod k)
  - Numbers k such that phi(k) = factorial of sum of digits of k
  - Numbers n such that omega(sigma(n,n)) = bigomega(sigma(n,n))
  - Numbers n such that sigma(n)+1 divides n*(tau(n)+1)
  - OEIS Conjecture
  - Odd squarefree composite integers n such that prev_prime(p)-1 | n-1 and next_prime(p)-1 | n-1 for every p|n
  - Other programs
  - Other
  - Palindromic pseudoprimes in base n
  - Partial sums of 2^(bigomega(n) - omega(n))
  - Partial sums of dirichlet convolution of the prime characterstic function with itself
  - Partial sums of inverse moebius transform of 2^bigomega(n)
  - Partial sums of moebius inversion of (-1)^omega
  - Partial sums of sums of prime powers
  - Pi search related sequences
  - Records of sigma0 for p^2-1
  - Reversal of prime p is composite in all bases 2..n
  - Riemann prime counting function
  - Romanian numbers
  - Sierpiński triangle
  - Smallest Carmichael number (A002997) with n prime factors that is also a strong pseudoprime to base 2 (A001262)
  - Smallest Carmichael number such that gpf(p-1) = prime(n)
  - Smallest Fermat base-2 pseudoprime such that gpf(p-1) = prime(n)
  - Smallest base-n strong Fermat pseudoprime with n distinct prime factors
  - Smallest number k > 0 such that bigomega(k^n + 1) = n
  - Smallest number k > 1 such that bigomega(k^n - 1) = n
  - Smallest overpseudoprime to base 2 (A141232) with n distinct prime factors
  - Smallest palindrome with n prime factors
  - Smallest prime p such that omega(p^n + 1) = n
  - Smallest squarefree palindrome with exactly n distinct palindromic prime factors
  - Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2
  - Surprising chaotic finite sequence
  - TODO
  - a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1)
- Darío Clavijo
- David James Sycamore
- Derek Orr
- Donovan Johnson
- Eder Vanzei
- Eduard Roure Perdices
- Elliott Line
- Erich Friedman
- Falcon Shapiro
- Farideh Firoozbakht
- Felix Fröhlich
- Fernando Solanet Mayou
- G. L. Honaker, Jr.
- Gionata Neri
- Giorgos Kalogeropoulos
- Giovanni Resta
- Gonzalo Martínez
- Greg Dresden
- Gus Wiseman
- Hans Havermann
- Howard Berman
- Hugo Pfoertner
- Ilya Gutkovskiy
- Irina Gerasimova
- Ivan N. Ianakiev
- J. Lowell
- J. M. Bergot
- J.W.L. (Jan) Eerland
- Jacques Tramu
- James S. DeArmon
- Jaroslav Krizek
- Jason Earls
- Jean-Marc Rebert
- Jeff Burch
- Jeppe Stig Nielsen
- Jianing Song
- Jinyuan Wang
- Jon E. Schoenfield
- Jonathan Sondow
- Jonathan Vos Post
- Joseph Biberstine
- José María Grau Ribas
- Jud McCranie
- Julien Peter Benney
- Juri-Stepan Gerasimov
- Kelvin Voskuijl
- Kevin Batista
- Kevin P. Thompson
- Kevin Ryde
- Klaus Brockhaus
- Labos Elemer
- Lekraj Beedassy
- Leroy Quet
- Lorenzo Sauras Altuzarra
- Luis H. Gallardo
- M. F. Hasler
- M. Farrokhi D. G.
- Maheswara Rao Valluri
- Manuel Valdivia
- Marco Ripà
- Marius A. Burtea
- Matthew Campbell
- Max Alekseyev
- Max Z. Scialabba
- Metin Sariyar
- Michael S. Branicky
- Michel Lagneau
- Michel Marcus
- Mohammed Bouayoun
- Muniru A Asiru
- N. J. A. Sloane
- Naohiro Nomoto
- Nicolas Bělohoubek
- Oliver Townsend
- Olivier Gérard
- Omar E. Pol
- Ovidiu Bagdasar
- Paolo Galliani
- Paolo P. Lava
- Paolo Xausa
- Patrick De Geest
- Paul Vanderveen
- Peter Kagey
- Peter Luschny
- Petros Hadjicostas
- Philip Mizzi
- Pierre CAMI
- Pontus von Brömssen
- Ralf Stephan
- Reinhard Zumkeller
- Richard N. Smith
- Richard Pinch
- Rick L. Shepherd
- Robert FERREOL
- Robert G. Wilson v
- Robert Israel
- Robert Price
- Ryan Propper
- Rémy Sigrist
- Scott R. Shannon
- Seiichi Manyama
- Sergio Pimentel
- Sezai Ata
- Shyam Sunder Gupta
- Sidney Cadot
- Sofia Lacerda
- Stefano Spezia
- T. D. Noe
- Tejo Vrush
- Thomas Gajdek
- Thomas Ordowski
- Tim Johannes Ohrtmann
- Tomohiro Yamada
- Tony Davie
- Torbjorn Alm
- Vincenzo Librandi
- Vladimir Letsko
- Vladimir Shevelev
- Wesley Ivan Hurt
- Ya-Ping Lu
- Yasutoshi Kohmoto
- Yusuf Gurtas
- Zak Seidov
- Zhao Hui Du
- Zhining Yang
pseudoprimes
sloane-gap
weditor
.gitignore
LICENSE
README.md
add_missing_shebangs.pl
oeis_terms.sf
sqrtrem_factorization.sf
update_readme.pl

Daniel Suteu

Jan 20, 2025

da14570 · Jan 20, 2025

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Files

Daniel Suteu

Daniel Suteu

Name	Name	Last commit message	Last commit date
parent directory ..
Added edits	Added edits	Remove commit history	Oct 3, 2020
Agrawal's conjecture pseudoprimes	Agrawal's conjecture pseudoprimes	Remove commit history	Oct 3, 2020
Alternating sum of the Mertens function	Alternating sum of the Mertens function	Recompress images.	Sep 21, 2023
Carmichael numbers k such that k+1 is divisible by gpf(k)+1	Carmichael numbers k such that k+1 is divisible by gpf(k)+1	Remove commit history	Oct 3, 2020
Carmichael numbers k where records occur for gcd(k-1, lambda(k))	Carmichael numbers k where records occur for gcd(k-1, lambda(k))	new file: oeis-research/Charles R Greathouse IV/Smallest k such that …	Oct 10, 2020
Carmichael numbers n where records occur for gpf(n) divided by lpf(n)	Carmichael numbers n where records occur for gpf(n) divided by lpf(n)	Added several more scripts.	Dec 25, 2023
Carmichael numbers n where records occur for lpf(n) divided by gpf(n)	Carmichael numbers n where records occur for lpf(n) divided by gpf(n)	Added several more scripts.	Dec 25, 2023
Carmichael-Lucas-Carmichael almost numbers	Carmichael-Lucas-Carmichael almost numbers	new file: oeis-research/Charles R Greathouse IV/Smallest k such that …	Oct 10, 2020
Chernick-Carmichael numbers with 4 or more prime factors	Chernick-Carmichael numbers with 4 or more prime factors	Remove commit history	Oct 3, 2020
Chernick-Carmichael numbers with k factors	Chernick-Carmichael numbers with k factors	Remove commit history	Oct 3, 2020
Chernick-Carmichael numbers	Chernick-Carmichael numbers	Remove commit history	Oct 3, 2020
Cubic recurence sequence	Cubic recurence sequence	Remove commit history	Oct 3, 2020
Difference of 0's and 1's in middle of binary digits	Difference of 0's and 1's in middle of binary digits	Recompress images.	Sep 21, 2023
Digit scrambling sequences	Digit scrambling sequences	Recompress images.	Sep 21, 2023
Dirichlet convolution of 2^omega(n)*mu(n)^2 with the positive integers	Dirichlet convolution of 2^omega(n)*mu(n)^2 with the positive integers	Remove commit history	Oct 3, 2020
Emirps	Emirps	Remove commit history	Oct 3, 2020
Factor sequences	Factor sequences	Remove commit history	Oct 3, 2020
Fast PARI program with moebius	Fast PARI program with moebius	Remove commit history	Oct 3, 2020
Fermat factors	Fermat factors	Recompress images.	Sep 21, 2023
Fermat pseudoprimes of the form p((p-1)n + 1)	Fermat pseudoprimes of the form p((p-1)n + 1)	Remove commit history	Oct 3, 2020
First number k such that k + a(i) has n distinct prime factors, for all i < n	First number k such that k + a(i) has n distinct prime factors, for all i < n	Update.	Nov 10, 2024
First number k such that k + a(i) is the product of n distinct prime factors, for all i < n	First number k such that k + a(i) is the product of n distinct prime factors, for all i < n	Update.	Nov 10, 2024
First number k such that the concatenation of a(i) and k has n distinct prime factors, for all i < n	First number k such that the concatenation of a(i) and k has n distinct prime factors, for all i < n	Update.	Nov 10, 2024
First number k such that the concatenation of a(i) and k has n prime factors, counted with multiplicity, for all i < n	First number k such that the concatenation of a(i) and k has n prime factors, counted with multiplicity, for all i < n	Update.	Nov 10, 2024
First number k such that the concatenation of k and a(i) has n distinct prime factors, for all i < n	First number k such that the concatenation of k and a(i) has n distinct prime factors, for all i < n	Update.	Nov 10, 2024
First number k such that the concatenation of k and a(i) has n prime factors, counted with multiplicity, for all i < n	First number k such that the concatenation of k and a(i) has n prime factors, counted with multiplicity, for all i < n	Update.	Nov 10, 2024
Generalized class of primes	Generalized class of primes	Remove commit history	Oct 3, 2020
Incrementally largest numbers n that are the product of primes p such that p+1 divides n	Incrementally largest numbers n that are the product of primes p such that p+1 divides n	Remove commit history	Oct 3, 2020
Irregular triangle read by rows of integers k such that n AND k != k, for k = 1..n	Irregular triangle read by rows of integers k such that n AND k != k, for k = 1..n	Recompress images.	Sep 21, 2023
Irregular triangle read by rows of integers k such that n AND k = k, for k = 1..n	Irregular triangle read by rows of integers k such that n AND k = k, for k = 1..n	Recompress images.	Sep 21, 2023
Large smooth semiprime	Large smooth semiprime	Remove commit history	Oct 3, 2020
Least non-palindromic number k such that k and its digital reversal both are the product of n distinct primes	Least non-palindromic number k such that k and its digital reversal both are the product of n distinct primes	Update.	Feb 15, 2023
Least number k such that A002277(k) has exactly n distinct prime factors	Least number k such that A002277(k) has exactly n distinct prime factors	Update.	Feb 9, 2023
Least prime p such that 2x(2*x+1) + p produces primes for x=0..n-1 and composite for x=n	Least prime p such that 2x(2*x+1) + p produces primes for x=0..n-1 and composite for x=n	new file: oeis-research/Daniel Suteu/Least prime p such that 2x(2*x…	Dec 22, 2024
Least prime p such that x(x+1)(x+2) + p produces primes for x=0..n-1 and composite for x=n	Least prime p such that x(x+1)(x+2) + p produces primes for x=0..n-1 and composite for x=n	new file: oeis-research/Daniel Suteu/Least prime p such that 2x(2*x…	Dec 22, 2024
Limit for pi ÷ 4	Limit for pi ÷ 4	Remove commit history	Oct 3, 2020
Liouville sum	Liouville sum	Update.	Jun 27, 2024
Moebius transform of dedekind	Moebius transform of dedekind	Remove commit history	Oct 3, 2020
Number k such that tau(k) equals the number of solutions to sigma(x) = k	Number k such that tau(k) equals the number of solutions to sigma(x) = k	Remove commit history	Oct 3, 2020
Number of distinct prime factors of sigma(sigma_n(n))	Number of distinct prime factors of sigma(sigma_n(n))	modified: factordb/auto.sf -- try to factor n, before failling	May 25, 2022
Number of primes factors of the n-th n-powerful number	Number of primes factors of the n-th n-powerful number	Remove commit history	Oct 3, 2020
Numbers k such that (prime(k) - composite(k)) == 0 (mod k)	Numbers k such that (prime(k) - composite(k)) == 0 (mod k)	Remove commit history	Oct 3, 2020
Numbers k such that phi(k) = factorial of sum of digits of k	Numbers k such that phi(k) = factorial of sum of digits of k	Remove commit history	Oct 3, 2020
Numbers n such that omega(sigma(n,n)) = bigomega(sigma(n,n))	Numbers n such that omega(sigma(n,n)) = bigomega(sigma(n,n))	Update.	Apr 6, 2022
Numbers n such that sigma(n)+1 divides n*(tau(n)+1)	Numbers n such that sigma(n)+1 divides n*(tau(n)+1)	new file: oeis-research/Daniel Lignon/Composite numbers for which the…	Feb 5, 2021
OEIS Conjecture	OEIS Conjecture	Remove commit history	Oct 3, 2020
Odd squarefree composite integers n such that prev_prime(p)-1 \| n-1 and next_prime(p)-1 \| n-1 for every p\|n	Odd squarefree composite integers n such that prev_prime(p)-1 \| n-1 and next_prime(p)-1 \| n-1 for every p\|n	new file: oeis-research/Daniel Suteu/Odd squarefree composite integer…	Jul 25, 2021
Other programs	Other programs	Remove commit history	Oct 3, 2020
Other	Other	Update.	Mar 24, 2023
Palindromic pseudoprimes in base n	Palindromic pseudoprimes in base n	Remove commit history	Oct 3, 2020
Partial sums of 2^(bigomega(n) - omega(n))	Partial sums of 2^(bigomega(n) - omega(n))	Remove commit history	Oct 3, 2020
Partial sums of dirichlet convolution of the prime characterstic function with itself	Partial sums of dirichlet convolution of the prime characterstic function with itself	Remove commit history	Oct 3, 2020
Partial sums of inverse moebius transform of 2^bigomega(n)	Partial sums of inverse moebius transform of 2^bigomega(n)	Remove commit history	Oct 3, 2020
Partial sums of moebius inversion of (-1)^omega	Partial sums of moebius inversion of (-1)^omega	Remove commit history	Oct 3, 2020
Partial sums of sums of prime powers	Partial sums of sums of prime powers	Remove commit history	Oct 3, 2020
Pi search related sequences	Pi search related sequences	Remove commit history	Oct 3, 2020
Records of sigma0 for p^2-1	Records of sigma0 for p^2-1	Remove commit history	Oct 3, 2020
Reversal of prime p is composite in all bases 2..n	Reversal of prime p is composite in all bases 2..n	Remove commit history	Oct 3, 2020
Riemann prime counting function	Riemann prime counting function	Remove commit history	Oct 3, 2020
Romanian numbers	Romanian numbers	Remove commit history	Oct 3, 2020
Sierpiński triangle	Sierpiński triangle	Remove commit history	Oct 3, 2020
Smallest Carmichael number (A002997) with n prime factors that is also a strong pseudoprime to base 2 (A001262)	Smallest Carmichael number (A002997) with n prime factors that is also a strong pseudoprime to base 2 (A001262)	All the Lucas-Carmichael numbers up to 10^15.	Nov 14, 2023
Smallest Carmichael number such that gpf(p-1) = prime(n)	Smallest Carmichael number such that gpf(p-1) = prime(n)	Remove commit history	Oct 3, 2020
Smallest Fermat base-2 pseudoprime such that gpf(p-1) = prime(n)	Smallest Fermat base-2 pseudoprime such that gpf(p-1) = prime(n)	Remove commit history	Oct 3, 2020
Smallest base-n strong Fermat pseudoprime with n distinct prime factors	Smallest base-n strong Fermat pseudoprime with n distinct prime factors	Update.	Mar 24, 2023
Smallest number k > 0 such that bigomega(k^n + 1) = n	Smallest number k > 0 such that bigomega(k^n + 1) = n	Update.	Jan 20, 2025
Smallest number k > 1 such that bigomega(k^n - 1) = n	Smallest number k > 1 such that bigomega(k^n - 1) = n	Update.	Jan 20, 2025
Smallest overpseudoprime to base 2 (A141232) with n distinct prime factors	Smallest overpseudoprime to base 2 (A141232) with n distinct prime factors	Update.	Sep 10, 2022
Smallest palindrome with n prime factors	Smallest palindrome with n prime factors	new file: oeis-research/Daniel Suteu/Smallest palindrome with n prime…	Oct 22, 2020
Smallest prime p such that omega(p^n + 1) = n	Smallest prime p such that omega(p^n + 1) = n	Update.	Jan 20, 2025
Smallest squarefree palindrome with exactly n distinct palindromic prime factors	Smallest squarefree palindrome with exactly n distinct palindromic prime factors	Update.	Feb 9, 2023
Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2	Square array A(n, k) read by antidiagonals downwards: smallest base-n strong Fermat pseudoprime with k distinct prime factors for k, n >= 2	Update.	Mar 24, 2023
Surprising chaotic finite sequence	Surprising chaotic finite sequence	Recompress images.	Sep 21, 2023
TODO	TODO	Update.	May 11, 2023
a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1)	a(1) = a(2) = 1, a(n) is largest prime factor of concatenation of a(n - 2) and a(n - 1)	Update.	Jun 10, 2022

Files

Daniel Suteu

Directory actions

More options

Directory actions

More options

Latest commit

History

Daniel Suteu

Folders and files

parent directory