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

%I #9 May 22 2019 04:02:12

%S 1,1,2,5,13,35,97,271,761,2143,6042,17043,48081,135656,382752,1079939,

%T 3047074,8597406,24257838,68444231,193117503,544886995,1537415492,

%U 4337865331,12239421132,34533905116,97438480950

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

%F a(n) ~ c * d^n, where d = 2.821530916787913161647514028120517886471375614018590071788760268658400644805..., c = 0.06693303886818014323088828992453194331872567432210373455545066012434187... - _Vaclav Kotesovec_, May 22 2019

%t Clear[a]; a[n_] := a[n] = If[n == 1, 1, Sum[Floor[a[n-1]/a[k]], {k, 1, n-1}]]; Table[a[n], {n, 1, 30}] (* _Vaclav Kotesovec_, May 22 2019 *)

%Y Cf. A022858, A022874.

%K nonn

%O 1,3

%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 19 19:02 EDT 2024. Contains 371798 sequences. (Running on oeis4.)