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

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A066356 Numerator of sequence defined by recursion c(n) = 1 + c(n-2) / c(n-1), c(0) = 0, c(1) = 1. 1
0, 1, 1, 2, 3, 7, 23, 167, 3925, 661271, 2609039723, 1728952269242533, 4516579101127820242349159, 7812958861560974806259705508894834509747, 35298563436210937269618773778802420542715366288238091341051372773 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,4

COMMENTS

a(i) and a(j) are relative prime for all i>j>0.

An infinite coprime sequence defined by recursion.

LINKS

Table of n, a(n) for n=0..14.

FORMULA

a(n) = (2 * a(n - 1) * a(n - 2)^2 - a(n - 1)^2 * a(n - 4) - a(n - 2)^3 * a(n - 3)) / (a(n - 2) - a(n - 3) * a(n - 4)).

a(n) = b(n) + b(n-1) * a(n-2) where b(n) = A064184(n).

MATHEMATICA

nxt[{a_, b_}]:={b, 1+a/b}; NestList[nxt, {0, 1}, 20][[All, 1]]//Numerator (* Harvey P. Dale, Sep 26 2016 *)

PROG

(PARI) {a(n) = if( n<4, max(0, n) - (n>1), (2 * a(n-1) * a(n-2)^2 - a(n-1)^2 * a(n-4) - a(n-2)^3 * a(n-3)) / (a(n-2) - a(n-3) * a(n-4)))}

CROSSREFS

Cf. A001685, A002715, A003686, A006695, A064184 (denominators), A064526.

Sequence in context: A001064 A108176 A111235 * A006892 A296397 A102710

Adjacent sequences:  A066353 A066354 A066355 * A066357 A066358 A066359

KEYWORD

nonn,easy

AUTHOR

Michael Somos, Dec 21 2001

STATUS

approved

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.

License Agreements, Terms of Use, Privacy Policy. .

Last modified October 19 07:29 EDT 2021. Contains 348074 sequences. (Running on oeis4.)