The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A140214 a(n) = Product_{h == 5 (mod 6) and h|n} h. 5
 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 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,5 COMMENTS Not multiplicative: a(5)*a(7) <> a(35). - R. J. Mathar, Oct 08 2011 LINKS 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 CROSSREFS Sequence in context: A170818 A046622 A170825 * A343431 A071020 A046601 Adjacent sequences:  A140211 A140212 A140213 * A140215 A140216 A140217 KEYWORD nonn,easy AUTHOR R. J. Mathar, Jun 27 2008 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 5 17:26 EDT 2021. Contains 343572 sequences. (Running on oeis4.)