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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A082097 a(n) = d(a(n-1)) + n = A000005(a(n-1)) + n, with a(1)=1. 1

%I

%S 1,1,1,5,7,8,11,10,13,12,17,14,17,16,20,22,21,22,23,22,25,25,26,28,31,

%T 28,33,32,35,34,35,36,42,42,43,38,41,40,47,42,49,45,49,47,47,48,57,52,

%U 55,54,59,54,61,56,63,62,61,60,71,62,65,66,71,66,73,68,73,70,77,74

%N a(n) = d(a(n-1)) + n = A000005(a(n-1)) + n, with a(1)=1.

%H G. C. Greubel, <a href="/A082097/b082097.txt">Table of n, a(n) for n = 1..10000</a>

%p with(numtheory);

%p a:= proc(n) option remember;

%p if n < 4 then 1

%p else tau(a(n-1)) + n

%p fi

%p end:

%p seq(a(n), n=1..70); # _G. C. Greubel_, Aug 31 2019

%t a[n_]:= If[n<4, 1, DivisorSigma[0, a[n-1]] + n]; Table[a[n], {n, 70}] (* modified by _G. C. Greubel_, Aug 31 2019 *)

%o (PARI) a(n) = if(n<4,1, numdiv(a(n-1)) + n); \\ _G. C. Greubel_, Aug 31 2019

%o (MAGMA) a:= func< n | n lt 4 select 1 else n + NumberOfDivisors(Self(n-1)) >;

%o [a(n): n in [1..70]]; // _G. C. Greubel_, Aug 31 2019

%o (Sage)

%o def a(n):

%o if n<4: return 1

%o else: return sigma(a(n-1), 0) + n

%o [a(n) for n in (1..70)] # _G. C. Greubel_, Aug 31 2019

%o (GAP)

%o a:= function(n)

%o if n<4 then return 1;

%o else return Tau(a(n-1)) + n;

%o fi;

%o end;

%o List([1..70], n-> a(n) ); # _G. C. Greubel_, Aug 31 2019

%Y Cf. A069103, A082094, A082095, A082096.

%K nonn

%O 1,4

%A _Labos Elemer_, Apr 11 2003

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 April 1 10:33 EDT 2020. Contains 333159 sequences. (Running on oeis4.)