26623
domain: N
Appears in sequences
- In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1.at n=30A006877
- In the '3x+1' problem, these values for the starting value set new records for highest point of trajectory before reaching 1.at n=15A006884
- '3x+1' record-setters (blowup factor).at n=10A025587
- Initial number for record sum of numbers in trajectory of 3x+1 problem.at n=33A033495
- In the '3x+1' problem, these values for the starting value set new records for number of steps to reach 1.at n=24A033958
- a(n) = (n+1)*2^(n-1) - 1.at n=11A099035
- a(n) = 1024*n - 1.at n=25A158421
- a(n) = 26*n^2 - 1.at n=31A158551
- Number of increasing sequences of n integers x(1),...,x(n) with values in 1..5*n such that x(j) divides x(k) iff j divides k.at n=22A180382
- a(n) = 13*2^n-1.at n=11A198274
- Number of nondecreasing sequences of n 1..6 integers with every element dividing the sequence sum.at n=37A212534
- Least number whose Collatz (3x+1) trajectory has a number greater than 10^n.at n=8A222291
- Least number whose Collatz 3x+1 trajectory contains a number >= 2^n.at n=26A222292
- Decimal representation of the n-th iteration of the "Rule 143" elementary cellular automaton starting with a single ON (black) cell.at n=7A267536
- Decimal representation of the middle column of the "Rule 143" elementary cellular automaton starting with a single ON (black) cell.at n=14A267539
- Number of n X 3 0..2 arrays with no element equal to any value at offset (-2,-2) (-1,0) or (-1,1) and new values introduced in order 0..2.at n=8A275126
- In the '3x+1' problem, these values for the starting value set new records for both the number of steps and the highest point of trajectory before reaching 1.at n=6A276665
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 205", based on the 5-celled von Neumann neighborhood.at n=21A286697
- Decimal representation of the diagonal from the origin to the corner of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 561", based on the 5-celled von Neumann neighborhood.at n=14A289378
- Bases in which 13 is a unique-period prime.at n=33A306077