43708

Appears in sequences

• Number of polyhedral graphs with n edges.at n=14A002840
• Number of partitions of prime(n) into prime parts smaller than itself.at n=25A168470
• Number of (n+2)X(n+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=3A252335
• Number of (n+2)X(4+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=3A252339
• T(n,k)=Number of (n+2)X(k+2) 0..2 arrays with every 3X3 subblock row, column, diagonal and antidiagonal sum not equal to 2 3 or 4.at n=24A252343
• a(n) = a(n-1) + a(n-2) + a([(n+1)/2]), where a(0) = 1, a(1) = 2, a(2) = 3.at n=19A298349
• a(n) = abs(a(n-1) - a(n-2)) if a(n-1) and a(n-2) are both prime or both composite. a(n) = a(n-1) + a(n-2) otherwise, where a(1) = 1 and a(2) = 2 and n > 2.at n=43A341130
• Number of integer partitions of n that cannot be partitioned into a set (or multiset) of sets with distinct sums.at n=46A381990