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!)
A074371 Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n. 0

%I #8 Apr 08 2019 18:58:51

%S 1,1,2,3,6,10,22,40,76,166,306,558,1260,2508,6876,13596,31068,66012,

%T 144636,298692,656532,1411650,3114050,6907892,12800744,24982760,

%U 51166280,112488680,239410280,501240080,1039913300,2346376556,4608703112,8900121992,18206157332

%N Sigmabonacci numbers: a(n)=a(n-1)+Sigma(a(n-2)). Sigma(n)=Sum of divisors of n.

%e a(9)=76=a(8)+Sigma(a(7))=40+(1+2+11+22)=40+36=76.

%t nxt[{a_,b_}]:={b,b+DivisorSigma[1,a]}; NestList[nxt,{1,1},40][[All,1]] (* _Harvey P. Dale_, Apr 08 2019 *)

%o (PARI) a(n) = if (n == 1, 1, if (n == 2, 1, a(n-1) + sigma(a(n-2)))); \\ _Michel Marcus_, Aug 15 2013

%K easy,nonn

%O 1,3

%A _Miklos Kristof_, Sep 24 2002

%E More terms from _Michel Marcus_, Aug 15 2013

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 12 02:10 EDT 2024. Contains 372431 sequences. (Running on oeis4.)