|
Search: id:A093879
|
|
| |
|
| 0, 1, 0, 1, 1, 0, 0, 1, 1, 1, 0, 1, 0, 0, 0, 1, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 1, 0, 1, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 0, 0
(list; graph; listen)
|
|
|
OFFSET
|
1,1
|
|
|
COMMENT
|
All the terms are 0 or 1: it is easy to show that if {b(n)} = A004001, b(n)>=b(n-1) and b(n)<n, therefore the first differences form an infinite binary word. - Benoit Cloitre, Jun 05 2004.
|
|
REFERENCES
|
J. Grytczuk, Another variation on Conway's recursive sequence, Discr. Math. 282 (2004), 149-161.
|
|
LINKS
|
R. J. Mathar, Table of n, a(n) for n = 1..9999
|
|
MATHEMATICA
|
a[1] = a[2] = 1; a[n_] := a[n] = a[a[n - 1]] + a[n - a[n - 1]]; t = Table[a[n], {n, 110}]; Drop[t, 1] - Drop[t, -1] (from Robert G. Wilson v May 28 2004)
|
|
PROGRAM
|
(PARI) {m=106; v=vector(m, j, 1); for(n=3, m, a=v[v[n-1]]+v[n-v[n-1]]; v[n]=a); for(n=2, m, print1(v[n]-v[n-1], ", "))}
|
|
CROSSREFS
|
Sequence in context: A090171 A118006 A108737 this_sequence A117872 A089809 A096270
Adjacent sequences: A093876 A093877 A093878 this_sequence A093880 A093881 A093882
|
|
KEYWORD
|
nonn,easy
|
|
AUTHOR
|
njas, May 27 2004
|
|
EXTENSIONS
|
More terms and PARI code from Klaus Brockhaus (klaus-brockhaus(AT)t-online.de) and Robert G. Wilson v (rgwv(AT)rgwv.com), May 27 2004
|
|
|
Search completed in 0.002 seconds
|
