A105697 A simple "Fractal Jump Sequence" (FJS).

2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 1, 2, 2, 2, 1, 2, 2, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 2, 2, 2, 2, 1, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 1, 1, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 2, 1, 1, 2, 1, 1, 1, 1, 1

Offset

1,1

Comments

See A105397 for definition of Fractal Jump Sequence.

Links

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Prog

(PARI) first(n)=my(v=apply(k->k+1, binary(255641055942322677663)), i=1, j=1); if(#v<n, v=concat(v, vector(3*n-#v))); while(i<=n, if(v[j]==0, v[j]=v[i]); if(v[i]==0, v[i]=v[j]); if(v[i]==0, v[i]=v[j]=1); if(v[i]!=v[j], error("Failed at step "i", "j", was "v[i]" and needed to be "v[j])); j+=v[j]+1; i++); v[1..n] \\ Charles R Greathouse IV, Aug 26 2017

Crossrefs

Sequence in context: A085030 A078377 A291454 * A340456 A080757 A037196

Adjacent sequences: A105694 A105695 A105696 * A105698 A105699 A105700

Keyword

easy,nonn

Author

Eric Angelini, May 04 2005

Extensions

Partially edited by N. J. A. Sloane, Jun 08 2010

Corrected and extended by Charles R Greathouse IV, Aug 26 2017

Status

approved