|
|
|
|
|
|
|
|
|
#39 by Alois P. Heinz at Tue Jul 16 17:03:27 EDT 2024
|
|
|
|
|
|
|
|
#38 by Alois P. Heinz at Tue Jul 16 17:03:15 EDT 2024
|
|
| FORMULA
|
a(n) = floor(prime(n)/2) mod 2.. - _Alois P. Heinz_, Jul 16 2024
|
|
|
|
|
Discussion
|
| Tue Jul 16
| 17:03
| Alois P. Heinz: trivial ...
|
|
|
|
|
|
|
#37 by Alois P. Heinz at Tue Jul 16 17:02:20 EDT 2024
|
|
|
|
|
|
|
|
#36 by Alois P. Heinz at Tue Jul 16 16:56:22 EDT 2024
|
|
|
|
|
|
|
|
#35 by Alois P. Heinz at Tue Jul 16 16:51:58 EDT 2024
|
|
| FORMULA
|
a(n) = ((prime(n)-2) mod 4) mod 3 (Conjectured). - Gary Detlefs, Dec 06 2011
|
|
| MAPLE
|
seq(((ithprime(n)-2) mod 4) mod 3, n= 1 ..300); # Gary Detlefs, Dec 06 2011
|
|
| STATUS
|
approved
editing
|
|
|
|
|
Discussion
|
| Tue Jul 16
| 16:52
| Alois P. Heinz: not correct ... not programs for conjectured formulas ...
|
|
|
|
|
|
|
#34 by Alois P. Heinz at Fri Jun 23 10:17:56 EDT 2023
|
|
|
|
|
|
|
|
#33 by Chai Wah Wu at Fri Jun 23 09:47:49 EDT 2023
|
|
|
|
|
|
|
|
#32 by Chai Wah Wu at Fri Jun 23 09:47:43 EDT 2023
|
|
| PROG
|
def A100672(n): return int(n==1 or prime(n)&3==3)>>1&1) # Chai Wah Wu, Jun 23 2023
|
|
| STATUS
|
proposed
editing
|
|
|
|
|
|
|
#31 by Chai Wah Wu at Fri Jun 23 09:45:06 EDT 2023
|
|
|
|
|
|
|
|
#30 by Chai Wah Wu at Fri Jun 23 09:44:57 EDT 2023
|
|
| PROG
|
(Python)
from sympy import prime
def A100672(n): return int(n==1 or prime(n)&3==3) # Chai Wah Wu, Jun 23 2023
|
|
| STATUS
|
approved
editing
|
|
|
|
|
|
