The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A371099 a(n) = gcd(36*n+9, A276086(36*n+9)), where A276086 is the primorial base exp-function. 2
 3, 15, 3, 3, 3, 21, 75, 3, 33, 3, 3, 15, 3, 3, 3, 3, 15, 3, 3, 231, 3, 15, 3, 3, 3, 3, 105, 3, 3, 3, 363, 75, 3, 21, 3, 3, 15, 3, 3, 3, 21, 165, 3, 3, 3, 3, 15, 3, 3, 3, 3, 15, 33, 3, 21, 3, 75, 3, 3, 3, 3, 735, 3, 33, 3, 3, 15, 3, 273, 3, 3, 15, 3, 3, 33, 21, 15, 3, 3, 3, 3, 975, 3, 3, 3, 33, 15, 3, 3, 21, 3, 15 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,1 COMMENTS All terms are multiples of 3, with A007949(a(n)) = 1 for all n. LINKS Antti Karttunen, Table of n, a(n) for n = 0..11550 Index entries for sequences related to primorial base FORMULA a(n) = A324198(A139609(n)). MATHEMATICA f[x_] := Block[{m, i, n = x, p}, m = i = 1; While[n > 0, p = Prime[i]; m *= p^Mod[n, p]; n = Quotient[n, p]; i++]; m]; Array[GCD[#, f[#]] &[36 # + 9] &, 100, 0] (* Michael De Vlieger, Mar 10 2024, after Jean-François Alcover at A276086 *) PROG (PARI) A324198(n) = { my(m=1, p=2, orgn=n); while(n, m *= (p^min(n%p, valuation(orgn, p))); n = n\p; p = nextprime(1+p)); (m); }; A371099(n) = A324198((36*n)+9); CROSSREFS Cf. A007949, A139609, A276086, A324198. Sequence in context: A048568 A119678 A096682 * A331228 A331697 A331225 Adjacent sequences: A371096 A371097 A371098 * A371100 A371101 A371102 KEYWORD nonn AUTHOR Antti Karttunen, Mar 10 2024 STATUS approved

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

Last modified June 18 15:05 EDT 2024. Contains 373481 sequences. (Running on oeis4.)