19685

Appears in sequences

• Numbers that are the sum of 5 nonzero 8th powers.at n=15A003383
• Numbers that are the sum of 3 positive 9th powers.at n=4A003392
• Numbers that are the sum of at most 3 positive 9th powers.at n=12A004887
• Numbers that are the sum of at most 4 positive 9th powers.at n=17A004888
• Numbers that are the sum of at most 5 positive 9th powers.at n=23A004889
• Numbers that are the sum of at most 6 positive 9th powers.at n=30A004890
• a(0) = 1, a(n) = 27*n^2 + 2 for n>0.at n=27A010017
• Pseudoprimes to base 63.at n=37A020191
• Fibonacci sequence beginning 1, 7.at n=18A022097
• a(n) = (n-1)*(n-2)*(n-3) + n.at n=28A034324
• Number of partitions of n with equal number of parts congruent to each of 0 and 2 (mod 5).at n=47A035553
• a(n) = 3*a(n-1) - a(n-2) with a(0) = 1, a(1) = 8.at n=9A055273
• a(n) = 2-(-3)^n.at n=9A081630
• a(n) = n^3 + 2.at n=27A084380
• Expansion of g.f. (3-x)*(1+3*x+x^2)/((1-x-x^2)*(1+x-x^2)).at n=17A099256
• Numbers of the form 3^n+2 which are not primes.at n=3A132830
• a(n) = 3^(2*n-1) + 2.at n=4A134752
• Numbers n with following property: let c = nearest cube to n that is different from n and let p = nearest prime to n that is different from n. Then |n-c| = |n-p|.at n=26A163497
• a(n) = 3^n + 2.at n=9A168607
• Triangle of numbers 2^i*C(n,i) mod 3 converted to decimal.at n=9A182069