35310

Appears in sequences

• Number of standard Young tableaux of type (n,n,n) whose (2,1) entry is odd.at n=5A011553
• Values of m such that N = (am+1)(bm+1)(cm+1) is a 3-Carmichael number (A087788), where a,b,c = 1,2,57.at n=9A065697
• a(n) = 9*a(n-2) - 4*a(n-3) for n > 2 with a(0)=1, a(1)=2.at n=11A122109
• a(n)=(F(n)-sumofdigits(F(n)))/9, where F(n) = A000045(n).at n=28A181065
• [s(k)-s(j)]/9, where the pairs (k,j) are given by A205872 and A205873, and s(k) denotes the (k+1)-st Fibonacci number.at n=35A205875
• a(n) is the smallest number that can be partitioned into n ways as the sum of two brilliant numbers (A078972).at n=30A338474
• a(n) is the index where A387090(n) appears in A386482.at n=31A386484