OFFSET
1,2
COMMENTS
LINKS
Harvey P. Dale, Table of n, a(n) for n = 1..1000
Henry Bottomley, Some Smarandache-type multiplicative sequences.
Kevin A. Broughan, Restricted divisor sums, Acta Arithmetica, 101(2) (2002), 105-114.
Kevin A. Broughan, Relationship between the integer conductor and k-th root functions, Int. J. Pure Appl. Math. 5(3) (2003), 253-275.
Kevin A. Broughan, Relaxations of the ABC Conjecture using integer k'th roots, New Zealand J. Math. 35(2) (2006), 121-136.
Henry Ibstedt, Surfing on the Ocean of Numbers, Erhus Univ. Press, Vail, 1997.
Eric Weisstein's World of Mathematics, Smarandache Ceil Function.
FORMULA
Multiplicative with a(p^e) = p^ceiling(e/6). - Christian G. Bower, May 16 2005
Sum_{k=1..n} a(k) ~ c * n^2, where c = (zeta(11)/2) * Product_{p prime} (1 - 1/p^2 + 1/p^3 - 1/p^4 + 1/p^5 - 1/p^6 + 1/p^7 - 1/p^8 + 1/p^9 - 1/p^10) = 0.3522558764... . - Amiram Eldar, Oct 27 2022
MATHEMATICA
spi[n_]:=Module[{k=1}, While[PowerMod[k, 6, n]!=0, k++]; k]; Array[spi, 80] (* Harvey P. Dale, Feb 29 2020 *)
f[p_, e_] := p^Ceiling[e/6]; a[1] = 1; a[n_] := Times @@ f @@@ FactorInteger[n]; Array[a, 100] (* Amiram Eldar, Sep 18 2020 *)
PROG
(PARI) a(n) = my(f=factor(n)); for (i=1, #f~, f[i, 2] = ceil(f[i, 2]/6)); factorback(f); \\ Michel Marcus, Feb 15 2015
CROSSREFS
KEYWORD
nonn,mult,easy
AUTHOR
R. Muller (Research37(AT)aol.com)
EXTENSIONS
Corrected by David W. Wilson, Jun 04 2002
STATUS
approved