38885

Appears in sequences

• a(n) = [ (3rd elementary symmetric function of S(n))/(first elementary symmetric function of S(n)) ], where S(n) = {first n+2 odd positive integers}.at n=20A024202
• Odd numbers with exactly 4 distinct palindromic prime factors.at n=16A046406
• Smallest multiple of the n-th prime such that every partial sum is a square.at n=25A085039
• a(n) = (5/6)*n^3+(5/2)*n^2+(8/3)*n.at n=35A092185
• Triangle read by rows: T(n,k) = (n+1,k)-th element of (M^10-M)/9, where M is the infinite lower Pascal's triangle matrix, 1<=k<=n.at n=24A096044
• Numbers whose set of base 6 digits is {0,5}.at n=33A097252
• Sum of all numbers having n or fewer digits and having the sum of their digits equal to n.at n=3A130835
• Numbers n such that n^6+6 and n^6-6 are prime.at n=5A239429
• Triangle of order m: C(n,k) = k*(n-k+1)^(k+m)+n-k, 0 <= k <= n, m = 0, read by rows.at n=60A278910
• Terms of A349937 that are not divisible by 3: numbers k > 1 not divisible by 2 or 3 such that A309906(k-1) < A309906(k) > A309906(k+1).at n=27A349941
• Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=35A382232
• Irregular triangle read by rows: T(n,k) = [x^k] (1+x) * A_n(x)^2, where A_n(x) is the n-th Eulerian polynomial.at n=40A382232