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

%I #8 Aug 06 2019 22:45:18

%S 1,1,1,2,3,4,6,9,13,20,30,45,68,103,156,236,358,542,821,1245,1887,

%T 2859,4333,6568,9954,15086,22865,34655,52524,79608,120657,182872,

%U 277169,420089,636704,965015,1462617,2216803,3359879,5092372

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

%H Robert Israel, <a href="/A022859/b022859.txt">Table of n, a(n) for n = 1..5000</a>

%p A[1]:= 1: A[2]:= 1:

%p for n from 3 to 100 do

%p A[n]:= floor(add(A[n-i]/A[i],i=1..n-1,2));

%p od:

%p seq(A[i],i=1..100); # _Robert Israel_, Aug 06 2019

%K nonn

%O 1,4

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