49167

Appears in sequences

• a(n)=a(n-1)+a(m), where m=2n-2-2^(p+1) and 2^p<n-1<=2^(p+1), for n >= 4.at n=38A050067
• a(n) = n*(5*n^2 - 3)/2.at n=27A063522
• If n mod 2 = 0 then 3*2^(n-1)+n-1 else 3*2^(n-1)+n.at n=14A116969
• A bisection of A063522.at n=13A160674
• Number of n X 3 array permutations with each element not moving, or moving one space N, SW or SE.at n=9A189429
• Number of (2+2) X (n+2) 0..3 arrays with every consecutive three elements in every row and diagonal having exactly two distinct values, and in every column and antidiagonal not having exactly two distinct values, and new values 0 upwards introduced in row major order.at n=33A252721
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 105", based on the 5-celled von Neumann neighborhood.at n=41A270162
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 334", based on the 5-celled von Neumann neighborhood.at n=15A281213
• Numbers k such that both k and k+1 are not exponentially squarefree numbers.at n=37A342188
• Numbers k such that k-1, k and k+1 are all composite with four, five and six (not necessarily distinct) prime factors respectively.at n=12A342246