[go: up one dir, main page]

login
Revision History for A067440 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Sum(i(n)), where i(n) is the smallest integer with i(n)^m=n for some m.
(history; published version)
#8 by N. J. A. Sloane at Thu Dec 05 19:55:08 EST 2013
AUTHOR

_Amarnath Murthy (amarnath_murthy(AT)yahoo.com), _, Jan 29 2002

Discussion
Thu Dec 05
19:55
OEIS Server: https://oeis.org/edit/global/2075
#7 by Russ Cox at Sat Mar 31 10:22:54 EDT 2012
EXTENSIONS

More terms from _Sascha Kurz (sascha.kurz(AT)uni-bayreuth.de), _, Mar 18 2002

Discussion
Sat Mar 31
10:22
OEIS Server: https://oeis.org/edit/global/354
#6 by N. J. A. Sloane at Fri Feb 27 03:00:00 EST 2009
EXAMPLE

a(8) = 28, as the smallest integer roots of numbers from 1 to 8 respectively are 1,2,3,2,5,6,7, and 2. Their sum = 28.

KEYWORD

nonn,new

nonn

#5 by N. J. A. Sloane at Wed Sep 22 03:00:00 EDT 2004
KEYWORD

nonn,new

nonn

EXTENSIONS

More terms from Sascha Kurz (sascha.kurz(AT)stud.uni-bayreuth.de), Mar 18 2002

#4 by N. J. A. Sloane at Sat Jun 12 03:00:00 EDT 2004
MAPLE

q[1] := 1:for n from 2 to 100 do a := ifactors(n):c := a[2][1][2]; for i from 2 to nops(a[2]) do c := igcd(c, a[2][i][2]); end do:q[n] := simplify(n^(1/c)); end do:for n from 1 to 100 do w[n] := sum('q[i3]', i3=1..n): end do:ww := seq(w[j4], j4=1..100);

KEYWORD

nonn,new

nonn

#3 by N. J. A. Sloane at Thu Feb 19 03:00:00 EST 2004
MAPLE

q[1]:=1:for n from 2 to 100 do a:=ifactors(n):c:=a[2][1][2]; for i from 2 to nops(a[2]) do c:=igcd(c, a[2][i][2]); end do:q[n]:=simplify(n^(1/c)); end do:for n from 1 to 100 do w[n]:=sum('q[i3]', i3=1..n): end do:ww:=seq(w[j4], j4=1..100);

KEYWORD

nonn,new

nonn

#2 by N. J. A. Sloane at Sat Sep 13 03:00:00 EDT 2003
KEYWORD

nonn,new

nonn

EXTENSIONS

More terms from Sascha Kurz (ssascha.kurz(AT)tustud.uni-bsbayreuth.de), Mar 18 2002

#1 by N. J. A. Sloane at Fri May 16 03:00:00 EDT 2003
NAME

Sum(i(n)), where i(n) is the smallest integer with i(n)^m=n for some m.

DATA

1, 3, 6, 8, 13, 19, 26, 28, 31, 41, 52, 64, 77, 91, 106, 108, 125, 143, 162, 182, 203, 225, 248, 272, 277, 303, 306, 334, 363, 393, 424, 426, 459, 493, 528, 534, 571, 609, 648, 688, 729, 771, 814, 858, 903, 949, 996, 1044, 1051, 1101, 1152, 1204, 1257, 1311

OFFSET

1,2

EXAMPLE

a(8) = 28, as the smallest integer roots of numbers from 1 to 8 respectively are 1,2,3,2,5,6,7, and 2. Their sum = 28.

MAPLE

q[1]:=1:for n from 2 to 100 do a:=ifactors(n):c:=a[2][1][2]; for i from 2 to nops(a[2]) do c:=igcd(c, a[2][i][2]); end do:q[n]:=simplify(n^(1/c)); end do:for n from 1 to 100 do w[n]:=sum('q[i3]', i3=1..n): end do:ww:=seq(w[j4], j4=1..100);

KEYWORD

nonn

AUTHOR

Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jan 29 2002

EXTENSIONS

More terms from Sascha Kurz (s.kurz(AT)tu-bs.de), Mar 18 2002

STATUS

approved