A140214 a(n) = Product_{h == 5 (mod 6) and h|n} h.
1, 1, 1, 1, 5, 1, 1, 1, 1, 5, 11, 1, 1, 1, 5, 1, 17, 1, 1, 5, 1, 11, 23, 1, 5, 1, 1, 1, 29, 5, 1, 1, 11, 17, 175, 1, 1, 1, 1, 5, 41, 1, 1, 11, 5, 23, 47, 1, 1, 5, 17, 1, 53, 1, 55, 1, 1, 29, 59, 5, 1, 1, 1, 1, 325, 11, 1, 17, 23, 175, 71, 1, 1, 1, 5, 1, 847, 1, 1, 5, 1, 41, 83, 1, 85, 1, 29, 11
Offset: 1
Programs
-
Maple
A140214 := proc(n) a := 1 ; for h in numtheory[divisors](n) do if (h mod 6) = 5 then a := a*h: fi; od: a; end: seq(A140214(n),n=1..120) ; # R. J. Mathar, Jun 24 2009
Comments