196610

Appears in sequences

• Smallest number > 1 equal to sum of n-th powers of its base-3 digits, or 0 if no such number exists (written in base 10).at n=14A033835
• a(n) = 2 + 2^(n+1)*(n-1).at n=13A036799
• Base-3 perfect digital invariants (written in base 10): numbers equal to the sum of the k-th powers of their base-3 digits, for some k.at n=32A162216
• Greatest integer equal to the sum of the n-th powers of its base-3 digits (written in base 10).at n=15A162218
• a(n) = 3*2^n + 2.at n=16A164094
• Number of (n+1) X 2 0..2 arrays with every 2 X 2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..2 introduced in row major order.at n=7A205354
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having the same number of equal diagonal or antidiagonal elements, and new values 0..2 introduced in row major order.at n=28A205361
• T(n,k)=Number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock in a row having an equal number of equal diagonal or equal antidiagonal elements, adjacent rows differing in this number, and new values 0..2 introduced in row major order.at n=28A205626
• 1/4 the number of (n+1) X 4 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=33A209722