25647

Appears in sequences

• Difference between length (A005341) and sum of digits (A004977) of n-th term in Look and Say Sequence (A005150).at n=37A056635
• a(n) is the action of recursively applying 'Rule 30' elementary cellular automata on the binary representation of n if the cells may only expand into the significant bit, a(0) = 1.at n=14A074890
• Indices of primes in sequence defined by A(0) = 29, A(n) = 10*A(n-1) - 11 for n > 0.at n=12A101968
• a(n) = 6*a(n-5) - a(n-10) + 98 with a(0)=0, a(1)=11, a(2)=35, a(3)=56, a(4)=104, a(5)=147, a(6)=204, a(7)=336, a(8)=455, a(9)=731.at n=19A118554
• Antidiagonal sums of A179748.at n=26A186425
• Unchanging value maps: number of nX4 binary arrays indicating the locations of corresponding elements unequal to no horizontal or vertical neighbor in a random 0..2 nX4 array.at n=4A219306
• Unchanging value maps: number of nX5 binary arrays indicating the locations of corresponding elements unequal to no horizontal or vertical neighbor in a random 0..2 nX5 array.at n=3A219307
• T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal or vertical neighbor in a random 0..2 nXk array.at n=31A219310
• T(n,k)=Unchanging value maps: number of nXk binary arrays indicating the locations of corresponding elements unequal to no horizontal or vertical neighbor in a random 0..2 nXk array.at n=32A219310
• Numbers x such that the sum of all their cyclic permutations is equal to that of all cyclic permutations of sigma(x) and all cyclic permutations of Euler totient function phi(x).at n=27A247317
• Number of (5+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=28A252724