login

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

A038388
Let f(n) be the smallest number such that the arithmetic mean (A) and geometric mean (G) of n and f(n) are both integers; sequence gives G values.
3
1, 2, 3, 4, 5, 6, 7, 4, 3, 10, 11, 12, 13, 14, 15, 8, 17, 6, 19, 20, 21, 22, 23, 12, 5, 26, 9, 28, 29, 30, 31, 8, 33, 34, 35, 12, 37, 38, 39, 20, 41, 42, 43, 44, 15, 46, 47, 24, 7, 10, 51, 52, 53, 18, 55, 28, 57, 58, 59, 60, 61, 62, 21, 16, 65, 66, 67, 68, 69, 70, 71, 12, 73, 74, 15
OFFSET
1,2
LINKS
FORMULA
Multiplicative with a(p^e) = p^((e+1)/2) if e is odd, 2^(e/2+1) if p=2 and e is even, p^(e/2) if p>2 and e is even. - Vladeta Jovovic, May 15 2003
Sum_{k=1..n} a(k) ~ c * n^2, where c = (13/24)*zeta(3)/zeta(2) = 0.395829... . - Amiram Eldar, Oct 27 2022
MATHEMATICA
Table[k = 1; While[Nand @@ IntegerQ /@ {(n + k)/2, g = Sqrt[n*k]}, k++]; g, {n, 75}] (* Jayanta Basu, Jul 14 2013 *)
f[p_, e_] := If[OddQ[e], p^((e + 1)/2), If[p == 2, 2^(e/2 + 1), p^(e/2)]]; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 09 2020*)
PROG
(PARI) a(n) = {my(f = factor(n)); prod(i = 1, #f~, if(f[i, 2]%2, f[i, 1]^((f[i, 2]+1)/2), if(f[i, 1]==2, 2^(f[i, 2]/2+1), f[i, 1]^(f[i, 2]/2)))); } \\ Amiram Eldar, Oct 27 2022
CROSSREFS
KEYWORD
nonn,easy,mult
AUTHOR
EXTENSIONS
More terms from Vladeta Jovovic, May 15 2003
STATUS
approved