20567

Appears in sequences

• Pseudoprimes to base 39.at n=35A020167
• Strong pseudoprimes to base 39.at n=13A020265
• Strong pseudoprimes to base 99.at n=19A020325
• a(n) = position of n^3 + (n+1)^3 + (n+2)^3 in A003072.at n=38A024972
• n-th 4k+1 prime times n-th 4k-1 prime.at n=16A048630
• 5-digit terms in the continued fraction for Pi.at n=10A048960
• Composite numbers x such that sigma(x+120) = sigma(x)+120.at n=29A054985
• (prime(n)*(prime(n+1)-1) + (prime(n)-1)*prime(n+1)) / 2.at n=32A099909
• Number of partitions of n having nonnegative even rank (the rank of a partition is the largest part minus the number of parts).at n=43A101709
• Row sums of triangle A143102.at n=38A143103
• Number of 5's in the last section of the set of partitions of n.at n=48A206555
• Number of n-digit 10th powers.at n=49A216654
• Consider a number x. Take the sum of its digits. Repeat the process deleting the first addendum and adding the previous sum. The sequence lists the numbers that after some iterations reach the arithmetic derivative of x.at n=22A269312
• Number of integers in n-th generation of tree T(3/4) defined in Comments.at n=49A274146
• a(1) = 1; for n > 1, a(n) is the smallest positive integer that has not yet appeared which contains all the distinct digits of the sum of all previous terms a(1)..a(n-1).at n=35A368347