34441

Appears in sequences

• a(n) is the number of partitions of 3n that can be obtained by adding together three (not necessarily distinct) partitions of n.at n=13A002220
• Strong pseudoprimes to base 6.at n=12A020232
• Strong pseudoprimes to base 17.at n=21A020243
• Strong pseudoprimes to base 36.at n=28A020262
• Strong pseudoprimes to base 65.at n=22A020291
• Shifts left and changes sign under Weigh transform.at n=24A038074
• Expansion of x*(11+20*x)/((1-x)*(1-10*x^2)).at n=8A094622
• a(n) = 1 + n*(n+1)*(n-1)/2.at n=41A158842
• Centered 40-gonal numbers.at n=41A195317
• a(n) = n*(7*n^2-12*n+7)/2.at n=22A226451
• Sphenic numbers k = p*q*r such that reversal(k) is also a sphenic number and reversal(k) = reversal(p)*reversal(q)*reversal(r).at n=27A242726
• Number of length n+1 0..4 arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=5A250642
• T(n,k)=Number of length n+1 0..k arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=41A250646
• Number of length 6+1 0..n arrays with the sum of the maximum of each adjacent pair multiplied by some arrangement of +-1 equal to zero.at n=3A250650
• Euler pseudoprimes to base 6: composite integers such that abs(6^((n - 1)/2)) == 1 mod n.at n=31A262053
• Number of maximum irredundant sets in the n-antiprism graph.at n=30A304567