login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A284478 a(n) = A005185(n) - A055748(n). 1
0, 0, 0, 1, 1, 1, 1, 1, 2, 2, 1, 2, 1, 0, 2, 1, 2, 3, 3, 3, 2, 2, 2, 5, 1, -1, 1, 2, 1, 0, 4, 1, 1, 4, 5, 3, 3, 4, 3, 4, 5, 5, 5, 3, 1, 3, 4, 8, -1, -1, 2, 1, 0, 0, 0, -1, 2, 0, 2, 1, 0, 0, 8, 1, -1, 6, 3, 1, 7, 7, 3, 4, 6, 5, 6, 5, 8, 5, 4, 5, 7, 7, 4, 8, 3, 7, 6, 4, 7, 9, 2, 0, 3, 2, 2, 18
(list; graph; refs; listen; history; text; internal format)
OFFSET
1,9
LINKS
EXAMPLE
a(4) = 1 because a(4) = A005185(4) - A055748(4) = 3 - 2 = 1.
MAPLE
A005185:= proc(n) option remember; procname(n-procname(n-1)) +procname(n-procname(n-2)) end proc:
A005185(1):= 1: A005185(2):= 1:
A055748:= proc(n) option remember; procname(procname(n-1)) +procname(n-procname(n-2)-1) end proc:
A055748(1):= 1: A055748(2):= 1:
A284478:= map(A005185 - A055748, [$1..1000]):
A284478:= seq(A284478[i], i=1..1000); # Altug Alkan, Apr 01 2017
MATHEMATICA
a[n_] := a[n] = If[n < 3, 1, a[n - a[n - 1]] + a[n - a[n - 2]]]; b[n_] := b[n] = If[n < 3, 1, b[b[n - 1]] + b[n - b[n - 2] - 1]]; Array[a[#] - b[#] &, 96] (* Michael De Vlieger, Mar 29 2017 *)
PROG
(PARI) q=vector(1000); c=vector(1000); q[1]=q[2]=1; for(n=3, #q, q[n]=(q[n-q[n-1]]+q[n-q[n-2]])); c[1]=c[2]=1; for(n=3, #c, c[n]=(c[c[n-1]]+c[n-c[n-2]-1])); va = vector(1000, n, q[n]-c[n])
CROSSREFS
Sequence in context: A333058 A084348 A210580 * A298948 A085906 A221649
KEYWORD
sign,look
AUTHOR
Altug Alkan, Mar 27 2017
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | 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 September 19 17:13 EDT 2024. Contains 376014 sequences. (Running on oeis4.)