30422

Appears in sequences

• a(0) = 1, a(n) = 20*n^2 + 2 for n>0.at n=39A010010
• Numbers n such that (i) the largest prime factor of n is not a palindrome and (ii) the sum of the factorials of the digits of n is equal to the largest prime factor of n reversed.at n=14A074301
• Let f(k) denote the largest prime factor of k which is not a palindrome. Sequence gives numbers k such that the sum of the factorials of the digits of k is equal to f(k) reversed.at n=14A111185
• Number of -3..3 arrays x(i) of n+1 elements i=1..n+1 with set{t,u,v in 0,1}((x[i+t]+x[j+u]+x[k+v])*(-1)^(t+u+v)) having two, four, five, six or seven distinct values for every i,j,k<=n.at n=5A211743
• Triangle read by rows: coefficients of the polynomials A_{3,4}(n,k).at n=31A245173
• Triangle read by rows: coefficients of the polynomials A_{3,4}(n,k).at n=37A245173
• a(n) is the smallest b > 1 such that p = prime(n) satisfies b^(p-1) == 1 (mod p^3).at n=31A249275
• Number of partitions of n with exactly four part sizes.at n=39A365630