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!)
A074201 Let b(1) = 1, b(2) = 2, b(n+2) = (b(n+1)+1)/(b(n)+1); then a(n) = 1 if b(n) >= 1 and a(n) = 0 otherwise (also a(n) = floor(b(n)) for n > 2). 0
1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 1, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1, 0, 0, 0, 1, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET
1
COMMENTS
The associated sequence b(n) is 1, 2, 3/2, 5/6, 11/15, 52/55, 321/286, 3035/2781 etc. - R. J. Mathar, Apr 06 2008
1/2 <= b(n) <= 2 for all n. There are no substrings "1,0,1" or "0,1,0". - Max Alekseyev, Feb 16 2012
LINKS
PROG
(PARI) lista(nn) = {my(x=1, y=2, z); print1("1, 1"); for(n=1, nn, z=(y+1)/(x+1); x=y; y=z; print1(", ", floor(z))); } \\ Jinyuan Wang, Mar 05 2020
CROSSREFS
Sequence in context: A266848 A068431 A266978 * A143466 A195053 A267136
KEYWORD
nonn,more
AUTHOR
Benoit Cloitre, Sep 17 2002
EXTENSIONS
More terms from R. J. Mathar, Apr 06 2008
a(54)-a(61) from Max Alekseyev, Apr 26 2010
a(62) from Max Alekseyev, Feb 16 2012
a(63)-a(70) from Jinyuan Wang, Mar 05 2020
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 May 6 18:59 EDT 2024. Contains 372297 sequences. (Running on oeis4.)