|
Search: id:A126606
|
|
|
| A126606 |
|
Fixed point of transformation of the seed sequence {0,2}, see comments. |
|
+0
2
|
|
| 0, 2, 2, 4, 2, 6, 4, 6, 2, 8, 6, 10, 4, 10, 6, 8, 2, 10, 8, 14, 6, 16, 10, 14, 4, 14, 10, 16, 6, 14, 8, 10, 2, 12, 10, 18, 8, 22, 14, 20, 6, 22, 16, 26, 10, 24, 14, 18, 4, 18, 14, 24, 10, 26, 16, 22, 6, 20, 14, 22, 8, 18, 10, 12, 2, 14, 12, 22, 10, 28, 18, 26, 8, 30, 22, 36, 14, 34, 20, 26
(list; graph; listen)
|
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Start with s={0,2} If sum of two neighbor terms sum=s(i)+s(i+1) is even then insert the sum in between, otherwise insert abs(s(i)-s(i+1)); repeat the procedure.
Triangle begins:
{0,2},
{0,2,2},
{0,2,2,4,2},
{0,2,2,4,2,6,4,6,2},
{0,2,2,4,2,6,4,6,2,8,6,10,4,10,6,8,2}.
Each row includes the previous one and then continues.
|
|
FORMULA
|
{s(i),s(i+1)} => {s(i),s(i)+s(i+1), s(i+1)}, if s(i)+s(i+1) is even, otherwise {s(i),s(i+1)} => {s(i), abs(s(i)-s(i+1)), s(i+1)}.
a(n) = 2 * A002487(n - 1). [From Reikku Kulon (reikku(AT)gmail.com), Oct 05 2008]
|
|
MATHEMATICA
|
s={0, 2}; Do[t=s; ti=1; Do[If[EvenQ[su=s[[i]]+s[[i+1]]], t=Insert[t, su, i+ti], t=Insert[t, Abs[s[[i]]-s[[i+1]]], i+ti]]; ti++, {i, Length[s]-1}]; s=t, {8}]; s
|
|
CROSSREFS
|
Cf. A002487 [From Reikku Kulon (reikku(AT)gmail.com), Oct 05 2008]
Sequence in context: A096002 A082175 A129292 this_sequence A077651 A004085 A086296
Adjacent sequences: A126603 A126604 A126605 this_sequence A126607 A126608 A126609
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Zak Seidov (zakseidov(AT)gmail.com), Mar 13 2007
|
|
|
Search completed in 0.007 seconds
|
