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!)
A051105 First differences of A005229. 2
0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 0, 1, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 0, 1, 0, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

G. C. Greubel, Table of n, a(n) for n = 1..5000

FORMULA

a(n) = A005229(n+1) - A005229(n). - G. C. Greubel, Mar 28 2022

MATHEMATICA

b[n_]:= b[n]= If[n<3, 1, b[b[n-2]] + b[n-b[n-2]]]; (* A005229 *)

A051105[n_]:= A051105[n] = b[n+1] -b[n];

Table[A051105[n], {n, 100}] (* G. C. Greubel, Mar 27 2022 *)

PROG

(Sage)

@CachedFunction

def b(n): # A005229

    if (n<3): return 1

    else: return b(b(n-2)) + b(n-b(n-2))

def A051105(n): return b(n+1) - b(n)

[A051105(n) for n in (1..100)] # G. C. Greubel, Mar 27 2022

CROSSREFS

Cf. A005229.

Sequence in context: A296211 A341642 A123506 * A284929 A286746 A155897

Adjacent sequences:  A051102 A051103 A051104 * A051106 A051107 A051108

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane

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 October 3 07:14 EDT 2022. Contains 357231 sequences. (Running on oeis4.)