OFFSET
1,2
COMMENTS
LINKS
Antti Karttunen, Table of n, a(n) for n = 1..10001
FORMULA
For all n >= 1, A246262(a(n)) = n.
MATHEMATICA
{1}~Join~Select[Range[144], Mod[Times @@ Map[NextPrime[#1]^#2 & @@ # &, FactorInteger[#]], 4] == 1 &] (* Michael De Vlieger, Mar 12 2021 *)
PROG
(Scheme, with Antti Karttunen's IntSeq-library)
(Python)
from sympy import factorint, prime, primepi
from operator import mul
def a003961(n):
f=factorint(n)
return 1 if n==1 else reduce(mul, [prime(primepi(i) + 1)**f[i] for i in f])
print([n for n in range(1, 201) if a003961(n)%4==1]) # Indranil Ghosh, Jun 12 2017
CROSSREFS
KEYWORD
nonn
AUTHOR
Antti Karttunen, Aug 21 2014
STATUS
approved