The On-Line Encyclopedia of Integer Sequences (OEIS)

Revision History for A221168 (Bold, blue-underlined text is an addition; faded, red-underlined text is a ~~deletion~~.)
Showing entries 1-10 | older changes

A221168

The infinite generalized Fibonacci word p^[4].
(history; published version)

#17 by Bruno Berselli at Thu Nov 30 04:06:05 EST 2017

STATUS

reviewed

approved

#16 by Joerg Arndt at Thu Nov 30 03:57:15 EST 2017

STATUS

proposed

reviewed

#15 by Michel Marcus at Thu Nov 30 00:48:22 EST 2017

STATUS

editing

proposed

#14 by Michel Marcus at Thu Nov 30 00:48:18 EST 2017

LINKS

José L. Ramírez, Gustavo N. Rubiano, and Rodrigo de Castro, <a href="http://arxiv.org/abs/1212.1368">A Generalization of the Fibonacci Word Fractal and the Fibonacci Snowflake</a>, arXiv preprint arXiv:1212.1368, [cs.DM], 2012-2014.

CROSSREFS

Cf. A221166-, A221167, A221169, A221170, A221171.

STATUS

proposed

editing

#13 by Jean-François Alcover at Thu Nov 30 00:45:00 EST 2017

STATUS

editing

proposed

#12 by Jean-François Alcover at Thu Nov 30 00:44:54 EST 2017

MATHEMATICA

fibi[n_, i_] := fibi[n, i] = Which[n == 0, {0}, n == 1, Append[Table[0, {j, 1, i - 1}], 1], True, Join[fibi[n - 1, i], fibi[n - 2, i]]];

fibonni[n_, i_] := fibonni[n, i] = Module[{fn, Fn}, For[fn = 0, True, fn++, Fn = fibi[fn, i]; If[Length[Fn] >= n + 1 && Length[Fn] > i + 3, Return[Fn[[n + 1]]]]]];

fmorph[n_, i_] := If[fibonni[n, i] == 0, 2, 0];

sigma1f[n_, i_] := If[n == 0, 1, 1 + Mod[Sum[fmorph[j, i], {j, 0, n - 1}], 4]];

sigma01f[n_, i_] := If[n == 0, 0, Mod[Sum[sigma1f[j, i], {j, 0, n - 1}], 4]]; a[n_] := sigma01f[n, 4]; Table[a[n], {n, 0, 100}] (* Jean-François Alcover, Nov 30 2017, after R. J. Mathar *)

STATUS

approved

editing

#11 by Joerg Arndt at Tue Jul 09 12:36:56 EDT 2013

STATUS

proposed

approved

#10 by R. J. Mathar at Tue Jul 09 12:34:27 EDT 2013

STATUS

editing

proposed

#9 by R. J. Mathar at Tue Jul 09 12:34:17 EDT 2013

DATA

0, 1, 0, 1, 0, 3, 0, 3, 0, 3, 2, 3, 2, 3, 0, 3, 0, 3, 0, 1, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 0, 3, 0, 3, 0, 1, 0, 1, 0, 1, 2, 1, 2, 1, 2, 3, 2, 3, 2, 1, 2, 1, 2, 1, 0, 1, 0, 1, 0, 3, 0, 3, 0, 1, 0, 1, 0, 1, 2, 1, 2, 1, 0, 1, 0, 1, 0, 3, 0, 3, 0, 3, 2, 3

MAPLE

# fmorph, sigma1f and sigma01f are defined in A221166.

A221168 := proc(n)

sigma01f(n, 4) ;

end proc: # R. J. Mathar, Jul 09 2013

KEYWORD

nonn,more

nonn

STATUS

approved

editing

#8 by T. D. Noe at Wed Apr 10 14:57:55 EDT 2013

STATUS

editing

approved