38810

Appears in sequences

• a(n) = C(2n-1,n-1) mod n^3.at n=39A099907
• Numbers k such that 2*10^k + 4*R_k - 3 is prime, where R_k = 11...1 is the repunit (A002275) of length k.at n=12A102952
• a(n) = (n^2+1)^2+1.at n=14A178390
• Number of (n+1)X2 0..3 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..3 introduced in row major order.at n=3A206594
• Number of (n+1)X5 0..3 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..3 introduced in row major order.at n=0A206597
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..3 introduced in row major order.at n=6A206600
• T(n,k)=Number of (n+1)X(k+1) 0..3 arrays with every 2X3 or 3X2 subblock having no more than three equal edges, and new values 0..3 introduced in row major order.at n=9A206600
• a(n) = binomial(2*c-1, c-1) (mod c^3), where c is the n-th composite.at n=26A244214
• Relative of Hofstadter Q-sequence: a(n) = max(0, n+19395) for n <= 0; a(n) = a(n-a(n-1)) + a(n-a(n-2)) + a(n-a(n-3)) for n > 0.at n=27A283886
• Number of partitions p of n such that (number of numbers in p that have multiplicity 1) <= (number of numbers in p having multiplicity > 1).at n=44A330146