login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo

Thanks to everyone who made a donation during our annual appeal!
To see the list of donors, or make a donation, see the OEIS Foundation home page.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307336 A fractal senary (6 elements) sequence: For all n >= 1, underline the term with index n + a(n) + 1; then the two subsequences of underlined terms and of non-underlined terms are both equal to the sequence itself. 9
5, 4, 3, 2, 1, 0, 5, 5, 5, 5, 5, 5, 4, 3, 2, 1, 0, 5, 5, 4, 3, 2, 1, 5, 5, 0, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 0, 5, 3, 2, 1, 5, 4, 5, 5, 0, 5, 3, 5, 2, 1, 0, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 2, 1, 0, 5, 4, 4, 3, 2, 1, 3, 2, 0, 5, 1, 5, 5, 3, 2, 4, 1, 5, 0, 5, 5, 5, 4, 3, 5, 2, 1, 0, 5, 5, 5, 0, 5, 5, 5, 5, 5, 3, 5, 5, 5, 5, 4 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

This is defined to be the lexicographically earliest senary sequence with the following property:

If a(n) = 0, underline a(n+1); if a(n) = 1, underline a(n+2); if a(n) = 2, underline a(n+3); if a(n) = 3, underline a(n+4); if a(n) = 4, underline a(n+5); if a(n) = 5, underline a(n+6). Now, the subsequence of (once or more) underlined terms must be equal to the original sequence (copy #1), and the subsequence of non-underlined terms must also reproduce the original sequence (copy #2).

LINKS

Carole Dubois, Table of n, a(n) for n = 1..2006

EXAMPLE

The sequence starts (5,4,3,2,1,0,5,5,5,5,5,5,4,3,2,1,0,5,5,...)

Instead of underlining terms, we will put parentheses around the terms we want to emphasize:

a(1) = 5 produces parentheses around a(1 + 6 = 7):

5,4,3,2,1,0,(5),5,5,5,5,5,4,3,2,1,0,5,5,...

a(2) = 4 produces parentheses around a(2 + 5 = 7), which is now already done. Then,

a(3) = 3 produces parentheses around a(3 + 4 = 7), which is already done. Then,

a(4) = 2 produces parentheses around a(4 + 3 = 7) - already done. Then,

a(5) = 1 produces parentheses around a(5 + 2 = 7) - already done. Then,

a(6) = 0 produces parentheses around a(6 + 1 = 7) - already done. Then,

a(7) = 5 produces parentheses around a(7 + 6 = 13):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),3,2,1,0,5,5,...

a(8) = 5 produces parentheses around a(8 + 6 = 14):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),(3),2,1,0,5,5,...

a(9) = 5 produces parentheses around a(9 + 6 = 15):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),(3),(2),1,0,5,5,...

a(10) = 5 produces parentheses around a(10 + 6 = 16):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),(3),(2),(1),0,5,5,...

a(11) = 5 produces parentheses around a(11 + 6 = 17):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),(3),(2),(1),(0),5,5,...

a(12) = 5 produces parentheses around a(12 + 6 = 18):

5,4,3,2,1,0,(5),5,5,5,5,5,(4),(3),(2),(1),(0),(5),5,...

a(13) = 4 produces parentheses around a(13 + 5 = 18) - already done. Then,

a(14) = 3 produces parentheses around a(14 + 4 = 18) - already done. Then,

a(15) = 2 produces parentheses around a(15 + 3 = 18) - already done. Then,

a(16) = 1 produces parentheses around a(16 + 2 = 18) - already done. Then,

a(17) = 0 produces parentheses around a(17 + 1 = 18) - already done. Etc.

We see in this small example that the parenthesized terms reproduce the initial sequence:

(5),(4),(3),(2),(1),(0),(5)...

The same is true for the subsequence of non-parenthesized terms:

5, 4, 3, 2, 1, 0, 5, 5, 5, 5, 5, 5,...

CROSSREFS

Cf. A307183 (first binary example of such fractal sequences), A307332 (ternary), A307333 (quaternary), A307335 (quinary), A307337 (septuary), A307338 (octal), A307339 (nonary), A307340 (decimal).

Sequence in context: A022961 A023447 A280916 * A031016 A261302 A284803

Adjacent sequences:  A307333 A307334 A307335 * A307337 A307338 A307339

KEYWORD

base,nonn

AUTHOR

Eric Angelini and Carole Dubois, Apr 02 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified January 22 04:26 EST 2020. Contains 331133 sequences. (Running on oeis4.)