id:A105102 - OEIS Search Results

Search: id:A105102

Displaying 1-1 of 1 results found.

page 1

A bi-Minimal Pisot substitution.

+0
1

1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 5, 4, 1, 2, 2, 3, 2, 3, 3, 5, 4, 2, 3, 3, 5, 4, 3, 5, 4, 5, 4, 6, 5, 1, 2, 2, 3, 2, 3, 3, 5, 4, 2, 3, 3, 5, 4, 3, 5, 4, 5, 4, 6, 5, 2, 3, 3, 5, 4, 3, 5, 4, 5, 4, 6, 5, 3, 5, 4, 5, 4, 6, 5, 5, 4, 6, 5, 6, 5, 2, 1, 6, 1, 2, 2, 3, 2, 3, 3, 5, 4, 2, 3, 3, 5, 4, 3, 5, 4, 5, 4 (list; graph; listen)

	OFFSET	`0,3`
	FORMULA	`1-> 2 2->3 3->{5, 4} 4->5 5->6 6->{2, 1}`
	MATHEMATICA	`s[1] = {2}; s[2] = {3}; s[3] = {5, 4}; s[4] = {5}; s[5] = {6}; s[6] = {2, 1}; t[a_] := Join[a, Flatten[s /@ a]]; p[0] = {1}; p[1] = t[{1}]; p[n_] := t[p[n - 1]] aa = Flatten[Table[p[n], {n, 0, 6}]]`
	CROSSREFS	`Cf. A073058.` `Sequence in context: A000120 A105062 A106487 this_sequence A105105 A054717 A086421` `Adjacent sequences: A105099 A105100 A105101 this_sequence A105103 A105104 A105105`
	KEYWORD	`nonn,uned`
	AUTHOR	`Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 07 2005`

page 1

Search completed in 0.002 seconds

Last modified December 17 23:40 EST 2009. Contains 171025 sequences.

AT&T Labs Research