11453246122
domain: N
Appears in sequences
- a(2n) = 2*a(2n-1), a(2n+1) = 2*a(2n)+1 (also a(n) is the n-th number without consecutive equal binary digits).at n=34A000975
- Barlow packings with group R3(bar)m(SO) that repeat after 6n+3 layers.at n=34A011954
- a(n) = a(n-1) + 2*a(n-2) with a(0)=0, a(1)=2.at n=34A014113
- a(n) = (2/3)*(4^n-1).at n=17A020988
- a(n) = C(n,1) + C(n,4) + ... + C(n, 3*floor(n/3) + 1).at n=34A024494
- Smallest numbers having in binary representation exactly n maximal groups of consecutive zeros.at n=17A087120
- Generalized multiplicative Jacobsthal sequence.at n=35A087464
- Pair reversal of a Jacobsthal sequence.at n=34A094359
- Numbers n whose binary representation is the first Fibonacci(n) binary digits of the pattern 1010101010101010...at n=8A108021
- a(n) = J(n+1) mod J(n), J(n)=A001045(n).at n=35A112691
- A024494 prefixed by a 0.at n=35A131708
- Second trisection of A024494.at n=11A132397
- a(n) = (2^n + 3 - 7*(-1)^n + 3*0^n)/6; or a(0) = 0 and for n > 0, a(n) = A005578(n-1) - (-1)^n.at n=36A135351
- a(n) = -1/6 + (-1)^n/2 + 2*4^n/3.at n=17A140322
- a(n) = (1/3)*(1 - (-2)^n + 3*(-1)^n ) = (-1)^(n+1)*A167030(n).at n=35A167193
- A020988 and A007583 interleaved.at n=34A193652
- a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4), a(0)=a(1)=0, a(2)=2, a(3)=3.at n=35A242563
- Number of (n+1) X 2 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=32A263053
- Number of (n+1) X 2 0..1 arrays with each row and column not divisible by 3, read as a binary number with top and left being the most significant bits.at n=33A263053
- Decimal representation of the n-th iteration of the "Rule 77" elementary cellular automaton starting with a single ON (black) cell.at n=17A266873