196609

Appears in sequences

• Numbers that are the sum of 4 nonzero 8th powers.at n=31A003382
• a(0) = 1; thereafter a(n) = 3*2^(n-1) + 1.at n=17A004119
• a(n) = T(7,n), array T given by A048472.at n=12A048479
• Values of n such that Sum[ -(-1)^(k) n/k (n-1)/(k+1),{k,1,n}] (n!!) is an integer.at n=32A078621
• a(n) = 3*2^floor((n-1)/2) + (-1)^n.at n=33A097581
• a(1) = 2, a(2) = 4; a(n) = 2*a(n-1) - 1.at n=17A103204
• Semiprimes in A103376.at n=26A103396
• a(n) = 3*4^n + 1.at n=8A140660
• a(n) = 6n^3 + 1, solution z in Diophantine equation x^3 + y^3 = z^3 - 2. It may be considered a Fermat near miss by 2.at n=31A163827
• a(n) = 3*2^n + 1.at n=16A181565
• a(n) = 6*8^n+1.at n=5A199554
• Half the number of (n+1) X 5 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=5A209531
• Half the number of (n+1) X 7 0..2 arrays with every 2 X 2 subblock having exactly two distinct clockwise edge differences.at n=3A209532
• T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=39A209534
• T(n,k)=Half the number of (n+1)X(k+1) 0..2 arrays with every 2X2 subblock having exactly two distinct clockwise edge differences.at n=41A209534
• 1/4 the number of (n+1) X 3 0..2 arrays with every 2 X 2 subblock having distinct clockwise edge differences.at n=33A209721
• Numbers of the form 2^k+3 or 3*2^k+1, k >= 2.at n=30A245179
• Number of n X 2 0..1 arrays with every element unequal to 0, 2, 3 or 5 king-move adjacent elements, with upper left element zero.at n=17A304004
• Indices where A354169 is the sum of two consecutive powers of 2.at n=30A354775