The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A110091 Denominators of sequence of rationals defined by r(n) = n for n<=1 and for n>1: r(n) = (sum of denominators of r(n-1) and r(n-2))/(sum of numerators of r(n-1) and r(n-2)). 2
1, 1, 1, 3, 1, 3, 5, 1, 5, 7, 1, 7, 9, 1, 9, 11, 1, 11, 13, 1, 13, 15, 1, 15, 17, 1, 17, 19, 1, 19, 21, 1, 21, 23, 1, 23, 25, 1, 25, 27, 1, 27, 29, 1, 29, 31, 1, 31, 33, 1, 33, 35, 1, 35, 37, 1, 37, 39, 1, 39, 41, 1, 41, 43, 1, 43, 45, 1, 45, 47, 1, 47, 49, 1, 49, 51, 1, 51, 53, 1, 53, 55 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,4
LINKS
FORMULA
a(3*k) = 2*k+1, a(3*k+1) = 1, a(3*k+2) = 2*k+1.
r(n) = A110090(n) / a(n).
a(n) = (A110090(n-1) + A110090(n-2))/GCD(a(n-1) + a(n-2), A110090(n-1) + A110090(n-2)).
MATHEMATICA
a[n_]:= a[n]= If[Mod[n, 3]==0, 2*Floor[n/3] +1, If[Mod[n, 3]==1, 1, 2*Floor[n/3] +1]]; Table[a[n], {n, 0, 100}] (* G. C. Greubel, Jun 16 2021 *)
PROG
(Sage)
def A110091(n):
if (n%3==0): return 2*(n//3) + 1
elif (n%3==1): return 1
else: return 2*(n//3) +1
[A110091(n) for n in (0..100)] # G. C. Greubel, Jun 16 2021
CROSSREFS
Cf. A110090 (numerators).
Sequence in context: A134231 A225598 A126637 * A263051 A284130 A005474
KEYWORD
nonn,frac
AUTHOR
Reinhard Zumkeller, Jul 14 2005
STATUS
approved

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 June 7 05:57 EDT 2024. Contains 373144 sequences. (Running on oeis4.)