31941

Appears in sequences

• Write down all the prime divisors in previous term.at n=3A006919
• a(0) = 1, a(n) = 19*n^2 + 2 for n>0.at n=41A010009
• Expansion of 1/((1-2*x)*(1-5*x)*(1-11*x)).at n=4A016301
• Expansion of 1/((1-2x)(1-5x)(1-6x)(1-8x)).at n=4A025987
• Numbers k such that sopfr(k + omega(k)) = sopfr(k), where sopfr(i) = A001414(i) and omega(i) = A001221(i).at n=27A187878
• a(n) = 4*n^3 - 3*n + 1.at n=20A280089
• a(1) = 1; for n > 1, if a(n-1) is composite then a(n) is the concatenation of all the prime factors in order of a(n-1), otherwise a(n) is the smallest number not yet appearing in the sequence.at n=13A331603
• Positions k where A348733(k) is not multiplicative.at n=34A348740