This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082771 Triangular array, read by rows: t(n,k) = Sum(d^k: d|n), 0<=k
 1, 2, 3, 2, 4, 10, 3, 7, 21, 73, 2, 6, 26, 126, 626, 4, 12, 50, 252, 1394, 8052, 2, 8, 50, 344, 2402, 16808, 117650, 4, 15, 85, 585, 4369, 33825, 266305, 2113665, 3, 13, 91, 757, 6643, 59293, 532171, 4785157, 43053283, 4, 18, 130, 1134, 10642, 103158, 1015690 (list; table; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS t(n,0)=A000005(n); t(n,1)=A000203(n), n>1; t(n,2)=A001157(n), n>2; t(n,3)=A001158(n), n>3; t(n,4)=A001159(n), n>4; t(n,5)=A001160(n), n>5; t(n,6)=A013954(n), n>6; t(n,n)=A023887(n). LINKS T. D. Noe, Rows n=1..100, flattened Eric Weisstein's World of Mathematics, Divisor Function FORMULA t(n, k) = Product(((p^((e(n, p)+1)*k))-1)/(p^k-1): n=Product(p^e(n, p): p prime)), 0<=k

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 23 19:07 EDT 2019. Contains 323528 sequences. (Running on oeis4.)