| .. |
|
12 June
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
12 May
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
13 June
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
13 May
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
15 May
|
ddbb6ebad1
modified: oeis-autoload/oeis.pl -- support for tables
|
%!s(int64=2) %!d(string=hai) anos |
|
17 May
|
7fba720525
Update.
|
hai 1 ano |
|
18 May
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
2 July 2019
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
22 July - comments
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
24 May
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
9 June
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Conjecture 13 July 2022
|
e25af477b0
new file: oeis-research/Derek Orr/Least prime p such that p^n and p^n+1 have the same number of prime factors (counted with multiplicity) or 0 if no such number exists/simple_prog.sf
|
hai 1 ano |
|
Divisibility of numerators of harmonic numbers
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Factor 2n
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Least k > 1 such that all divisors d of (k^(2n+1)+1) over (k+1) satisfy d == 1 (mod 2n+1)
|
a38dc6d971
Update.
|
hai 1 ano |
|
Non-residue pseudoprimes
|
f6c160affc
Update.
|
%!s(int64=3) %!d(string=hai) anos |
|
Primes sum of squares
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Smallest k such that 2^(2^n+1)-1 + 2^k is prime, or -1 if no such k exists
|
986b4f84f2
Update.
|
hai 4 meses |
|
Super-poulet conjecture
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Thomasz a and b sequences
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz base = 5 primes
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz mod 1 divisors
|
7fba720525
Update.
|
hai 1 ano |
|
Tomasz new sequences
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz p+1 semiprimes
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz rad p+1 pseudoprimes
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz rad p-1 pseudoprimes
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomasz squarefree conjecture
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
Tomazs znorder primes
|
4d085c9032
Remove commit history
|
%!s(int64=3) %!d(string=hai) anos |
|
a(n) is the smallest b > 0 such that b^(2n) + 1 has all prime divisors p == 1 (mod 2n)
|
a38dc6d971
Update.
|
hai 1 ano |
|
a(n) is the smallest k with n prime factors such that p^k == p (mod k) for every prime p dividing k
|
a38dc6d971
Update.
|
hai 1 ano |
|
a(n) is the smallest number k with n prime factors such that p + div(k,p) is prime for every prime p | k
|
c6ec26b5eb
new file: oeis-research/Bernard Schott/a(n) is the largest prime < 10^n obtained with the longest sum of consecutive primes/prog_fast.pl
|
%!s(int64=3) %!d(string=hai) anos |
|
a(n) is the smallest odd b > 1 such that (b^(2n) + 1) over 2 has all prime divisors p == 1 (mod 2n)
|
a38dc6d971
Update.
|
hai 1 ano |
