|
Search: id:A114730
|
|
|
| A114730 |
|
One of a family of fractal sequences that transforms into each other. |
|
+0 6
|
|
| 1, 1, 2, 2, 1, 1, 1, 2, 3, 4, 3, 3, 2, 2, 1, 1, 1, 2, 3, 4, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 9, 9, 8, 8, 7, 7, 6, 6, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 2, 3, 4, 5
(list; graph; listen)
|
|
|
OFFSET
|
1,3
|
|
|
COMMENT
|
Let A be the sequence A114729 (1, 1, 1, 2, 3, 2, 2, 1, 1, 1, ...), B be the sequence A114730 (1, 1, 2, 2, 1, 1, 1, 2, 3, 4, ...) and C be the sequence A114731 (1, 2, 1, 1, 1, 2, 3, 3, 2, 2, ...). Let D be the sequence A114732 (1, 2, 3, 1, 1, 2, 3, 4, 5, 6, ...), E be the sequence A114733 (1, 2, 1, 2, 3, 4, 5, 3, 1, 1, ...) and F be the sequence A114734 (1, 1, 2, 3, 4, 2, 1, 2, 3, 4, ...). Then:
- A upper trims to B
- B upper trims to C
- C upper trims to A
- A lower trims to C
- B lower trims to A
- C lower trims to B
- D gives the number of times each element of A occurs
- E gives the number of times each element of B occurs
- F gives the number of times each element of C occurs
- A gives the number of times each element of D occurs
- B gives the number of times each element of E occurs
- C gives the number of times each element of F occurs
- D lower trims to E
- E lower trims to F
- F lower trims to D
- D upper trims to F
- E upper trims to D
- F upper trims to E
|
|
EXAMPLE
|
E(9)=1 and that's the third 1 in sequence E, so B(9)=3.
|
|
CROSSREFS
|
Cf. A114729, A114731, A114732, A114733, A114733.
Sequence in context: A071127 A029381 A027926 this_sequence A031282 A085685 A112465
Adjacent sequences: A114727 A114728 A114729 this_sequence A114731 A114732 A114733
|
|
KEYWORD
|
nonn
|
|
AUTHOR
|
Kerry Mitchell (lkmitch(AT)gmail.com), Dec 28 2005
|
|
|
Search completed in 0.002 seconds
|