[go: up one dir, main page]

login
Revision History for A105062 (Bold, blue-underlined text is an addition; faded, red-underlined text is a deletion.)

Showing all changes.
Triangle read by rows, based on the morphism f: 1->2, 2->3, 3->4, 4->5, 5->6, 6->{6,6,10,7}, 7->8, 8->9, 9->10, 10->11, 11->12, 12->{12,12,5,1}. First row is 1. If current row is a,b,c,..., then the next row is a,b,c,...,f(a),f(b),f(c),...
(history; published version)
#6 by Charles R Greathouse IV at Wed Mar 12 16:36:46 EDT 2014
AUTHOR

_Roger L. Bagula_, Apr 05 2005

Discussion
Wed Mar 12
16:36
OEIS Server: https://oeis.org/edit/global/2126
#5 by Russ Cox at Fri Mar 30 18:49:14 EDT 2012
AUTHOR

_Roger Bagula (rlbagulatftn(AT)yahoo.com), _, Apr 05 2005

Discussion
Fri Mar 30
18:49
OEIS Server: https://oeis.org/edit/global/236
#4 by N. J. A. Sloane at Sun Jun 29 03:00:00 EDT 2008
LINKS

Richard Kenyon, <a href="http://arxivarXiv.org/abs/math.MG/9505210">The Construction of Self-Similar Tilings</a>

KEYWORD

nonn,tabf,new

#3 by N. J. A. Sloane at Fri Sep 29 03:00:00 EDT 2006
COMMENTS

11's and 12's don't do not show up until the 8th iteration, below that it resembles the lower bi-Kenyons

KEYWORD

nonn,tabf,new

#2 by N. J. A. Sloane at Tue Jul 19 03:00:00 EDT 2005
NAME

Level Triangle read by rows, based on the morphism f: 1->2, 2->3, 3->4, 4->5, 5->6, 6->{6,6 ,10,7}, 7->8, 8->9, 9->10, 10->11, 11->12, 12->{12,12,5,1}. First row is 1. If current row is a,b,c,..., then the next row is a,b,c,...,f(a),f(b-Kenyon substitution sequence),f(c),...

COMMENTS

Level 6 bi-Kenyon substitution sequence.

FORMULA

1->2 2->3 3->4 4->5 5->6 6->{6,6,10,7} 7->8 8->9 9->10 10->11 12->{12,12,5,1}

MATHEMATICA

s[n_] := n /. {1] = { -> 2}; s[, 2] = { -> 3}; s[, 3] = { -> 4}; s[, 4] = -> 5; s[, 5] = { -> 6} ; s[, 6] = -> {6, 6, 10, 7}; s[, 7] = { -> 8}; s[, 8] = { -> 9}; s[, 9] = { -> 10}; s[, 10] = { -> 11}; s[, 11] = { -> 12}; s[, 12] = -> {12, 12, 5, 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 NestList[n], t, {n, 0, 81}, 6]]

CROSSREFS
KEYWORD

nonn,uned,newtabf

#1 by N. J. A. Sloane at Sat Apr 09 03:00:00 EDT 2005
NAME

Level 6 b-Kenyon substitution sequence.

DATA

1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, 2, 3, 3, 4, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 1, 2, 2, 3, 2, 3, 3, 4, 2, 3, 3, 4, 3, 4, 4, 5, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4, 4, 5, 4, 5, 5, 6, 2, 3, 3, 4, 3, 4, 4, 5, 3, 4

OFFSET

0,3

COMMENTS

11's and 12's don't show up until the 8th iteration, below that it resembles the lower bi-Kenyons

LINKS

Richard Kenyon, <a href="http://arxiv.org/abs/math.MG/9505210">The Construction of Self-Similar Tilings</a>

FORMULA

1->2 2->3 3->4 4->5 5->6 6->{6,6,10,7} 7->8 8->9 9->10 10->11 12->{12,12,5,1}

MATHEMATICA

s[1] = {2}; s[2] = {3}; s[3] = {4}; s[4] = 5; s[5] = {6} ; s[6] = {6, 6, 10, 7}; s[7] = {8}; s[8] = {9}; s[9] = {10}; s[10] = {11}; s[11] = {12}; s[12] = {12, 12, 5, 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, 8}]]

CROSSREFS
KEYWORD

nonn,uned,new

AUTHOR

Roger Bagula (rlbagulatftn(AT)yahoo.com), Apr 05 2005

STATUS

approved