cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

User: Juan Carlos Nuño

Juan Carlos Nuño's wiki page.

Juan Carlos Nuño has authored 1 sequences.

A333363 Horizontal visibility sequence at the onset of chaos in the 3-period cascade.

Original entry on oeis.org

3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 9, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 11, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 9, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 13, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 9, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 11, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 9, 3, 2, 5, 3, 2, 7, 3, 2, 5, 3, 2, 15
Offset: 1

Author

Keywords

Comments

This sequence represents the horizontal visibility of the points of the chaotic time series at the onset of chaos in the 3-period cascade of the logistic (unimodal) map.
Observation: if the sequence is written as a table array with six columns read by rows we have that, at least for the first 16 rows, the n-th row is "3, 2, 5, 3, 2" together with (6 + A037227(n)), see the example. - Omar E. Pol, Mar 16 2020

Examples

			From _Omar E. Pol_, Mar 16 2020: (Start)
Written as a table with six columns read by rows:
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2,  9;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2, 11;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2,  9;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2, 13;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2,  9;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2, 11;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2,  9;
  3, 2, 5, 3, 2,  7;
  3, 2, 5, 3, 2, 15;
(End)
		

Crossrefs

Programs

  • Mathematica
    L[n_] := L[n] = Block[{s = {3, 2, 2*n+3}}, Do[s = Join[L[i], s], {i, n-1}]; s]; L[6] (* Giovanni Resta, Mar 16 2020 *)
  • R
    visibsuc3 <- function(n){
        suc <- c(3,2, 2*(n+1)+1)
        if(n>1){
        for(i in 1:(n-1)){
        suc <- c(visibsuc3(i), suc)
        }
       }
       return(suc)
      }

Formula

Conjectured: a(n) = 2*A007814(n/3) + 5 if 3|n and a(n) = 4 - (n mod 3) otherwise. - Giovanni Resta, Mar 16 2020