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!)
A022863 a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3. 2

%I #12 Jun 25 2016 01:41:04

%S 1,2,2,3,5,8,13,21,34,55,89,144,234,379,615,998,1619,2627,4263,6918,

%T 11226,18217,29561,47970,77844,126321,204988,332645,539801,875964,

%U 1421474,2306702,3743209,6074307,9857105,15995654,25957009,42121835

%N a(n) = [ a(n-1)/a(1) + a(n-2)/a(2) + ... + a(1)/a(n-1) ], for n >= 3.

%H Clark Kimberling, <a href="/A022863/b022863.txt">Table of n, a(n) for n = 1..1000</a>

%F a(n) ~ c * d^n, where d = 1.62275381745856884115747797718538977396890203478399837508696442768520..., c = 0.43142665986772109399057405488003450887636739499705486305469410649365... . - _Vaclav Kotesovec_, Jun 24 2016

%t a[1] = 1; a[2] = 2; a[3] = 2;

%t a[n_] := a[n] = Floor[Sum[a[n - k]/a[k], {k, 1, n - 1}]];

%t Table[a[n], {n, 1, 100}] (* _Clark Kimberling_, Jun 23 2016 *)

%Y Cf. A022864.

%K nonn

%O 1,2

%A _Clark Kimberling_

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 April 25 03:15 EDT 2024. Contains 371964 sequences. (Running on oeis4.)