login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A367131 a(n) is the sum of the divisors of A000058(n) (Sylvester's sequence). 1
3, 4, 8, 44, 1960, 3263444, 10697794573312, 113429214231136770625234912, 12864938683281101589385656009398714729057117020127552, 166504803622354833425112235578181474001920862856209391632362182416351065666575351284563698791731209336320 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,1
LINKS
FORMULA
a(n) = sigma(A000058(n)) = A000203(A000058(n)).
MATHEMATICA
a000058[0] = 2; a000058[n_Integer?NonNegative] := a000058[n] = a000058[n - 1]^2 - a000058[n - 1] + 1; a[n_Integer?NonNegative] := a[n] = DivisorSigma[1, a000058[n]]; Table[a[n], {n, 0, 9}] (* Robert P. P. McKone, Nov 05 2023 *)
PROG
(Python)
from sympy import divisor_sigma
memo = {0: 2}
def a000058(n):
if n not in memo:
memo[n] = a000058(n - 1)**2 - a000058(n - 1) + 1
return memo[n]
a = lambda n: divisor_sigma(a000058(n))
print([a(n) for n in range(10)])
# Robert P. P. McKone, Nov 05 2023
CROSSREFS
Sequence in context: A180629 A258372 A096847 * A011993 A286125 A180169
KEYWORD
nonn
AUTHOR
Sean A. Irvine, Nov 05 2023
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 5 23:49 EDT 2024. Contains 372290 sequences. (Running on oeis4.)