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!)
A139423 a(1)=1, a(2)=2. For n >= 3, a(n) = a(n-1) + d(a(n-1)) + d(a(n-2)), where d(m) is the number of positive divisors of m. 1

%I

%S 1,2,5,9,14,21,29,35,41,47,51,57,65,73,79,83,87,93,101,107,111,117,

%T 127,135,145,157,163,167,171,179,187,193,199,203,209,217,225,238,255,

%U 271,281,285,295,307,313,317,321,327,335,343

%N a(1)=1, a(2)=2. For n >= 3, a(n) = a(n-1) + d(a(n-1)) + d(a(n-2)), where d(m) is the number of positive divisors of m.

%p with(numtheory): a[1]:=1: a[2]:=2: for n from 3 to 50 do a[n]:=a[n-1]+tau(a[n-1])+tau(a[n-2]) end do: seq(a[n],n=1..50); # _Emeric Deutsch_, Apr 30 2008

%t Join[{a = 1, b = 2}, Table[c = b + Total[DivisorSigma[0, {a, b}]]; a = b; b = c; c, {n, 48}]] (* _Jayanta Basu_, Jun 06 2013 *)

%Y Cf. A139422, A064491.

%K nonn

%O 1,2

%A _Leroy Quet_, Apr 21 2008

%E More terms from _Emeric Deutsch_, Apr 30 2008

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 7 16:01 EDT 2020. Contains 335496 sequences. (Running on oeis4.)