

A249032


First differences of A075326.


4



3, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 6, 4, 6, 4, 5, 5, 6, 4, 5, 5, 6, 4, 5, 5, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

0,1


COMMENTS

Can be constructed as follows. Apart from the initial "3", one always has either "64" (i.e., a 6 followed by a 4), or else "55". The 64's always come either alone (64) or triply (64, 64, 64), while the 55's always come alone. So if we let "64, 55" be represented by the numeral "1", and "64, 64, 64, 55" by the numeral "3", then the sequence of first differences, in this compressed code, is A080426, which itself is defined by a simple substitution rule.  D. R. Hofstadter, Oct 23 2014


LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 0..10000
D. R. Hofstadter, AntiFibonacci numbers, Oct 23 2014
Thomas Zaslavsky, AntiFibonacci Numbers: A Formula, Sep 26 2016


PROG

(Haskell)
a249032 n = a249032_list !! n
a249032_list = zipWith () (tail a075326_list) a075326_list
 Reinhard Zumkeller, Oct 26 2014


CROSSREFS

Cf. A075326, A080426, A249031.
Sequence in context: A023676 A318524 A155530 * A251534 A073233 A011287
Adjacent sequences: A249029 A249030 A249031 * A249033 A249034 A249035


KEYWORD

nonn


AUTHOR

N. J. A. Sloane, Oct 26 2014


STATUS

approved



