login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A264786 Let { d_1, d_2, ..., d_k } be the divisors of n. Then a(n) = d_k^1 + d_(k-1)^2 + ... + d_1^k. 0
1, 3, 4, 9, 6, 24, 8, 33, 19, 44, 12, 226, 14, 72, 68, 161, 18, 429, 20, 534, 98, 152, 24, 3858, 51, 204, 136, 856, 30, 6534, 32, 1089, 182, 332, 210, 22965, 38, 408, 236, 12886, 42, 14262, 44, 2148, 1868, 584, 48, 128338, 99, 2333, 368, 3214, 54, 21810, 302 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

LINKS

Table of n, a(n) for n=1..55.

Carlos Eduardo Olivieri, A polynomial from divisors of n

EXAMPLE

For n = 4: a(4) = 4^1 + 2^2 + 1^3 = 9.

For n = 5: a(5) = 5^1 + 1^2 = 6.

For n = 6: a(6) = 6^1 + 3^2 + 2^3 + 1^4 = 24.

MATHEMATICA

a[n_] := Sum[Sort[Divisors[n], #1 > #2 &][[i]]^i, {i, DivisorSigma[0, n]}]; Table[a[n], {n, 60}]

PROG

(PARI) a(n) = my(d = divisors(n)); sum(k=1, #d, d[k]^(#d-k+1)); \\ Michel Marcus, Jan 01 2016

CROSSREFS

Cf. A027750, A180851.

Sequence in context: A132065 A157020 A180253 * A055225 A054791 A167531

Adjacent sequences:  A264783 A264784 A264785 * A264787 A264788 A264789

KEYWORD

nonn,easy

AUTHOR

Carlos Eduardo Olivieri, Nov 29 2015

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 15 04:34 EDT 2020. Contains 335763 sequences. (Running on oeis4.)