20088

Appears in sequences

• Number of partitions in parts not of the form 15k, 15k+3 or 15k-3. Also number of partitions with at most 2 parts of size 1 and differences between parts at distance 6 are greater than 1.at n=42A035957
• Smallest positive number that needs more lines when shown on a 7-segment display (digital clock) than any previous term.at n=26A038619
• Numbers k such that sigma(k)+1 is a square and sets a new record for such squares.at n=37A063729
• a(n) = x is the smallest number such that gcd(prime(x)-1,x-1) = n.at n=52A084315
• Where record values occur in A010371.at n=24A143617
• Hypercomma numbers: n occurs in the sequence S[k+1]=S[k]+10*last_digit(S[k-1])+first_digit(S[k]) for each "legal" splitting n=concat(S[0],S[1]).at n=38A166508
• Numbers of the form p^4*q^3*r where p, q, and r are distinct primes.at n=24A179698
• Number of (w,x,y,z) with all terms in {1,...,n} and w>2x and y<=3z.at n=18A212517
• Smallest positive number using exactly n segments on a calculator display (when '6' and '7' are represented using 6 resp. 3 segments).at n=29A216261
• Row sums of A286782.at n=5A287039
• a(n) = A008412(n-1) + A008412(n-2) for n>1, a(0)=0, a(1)=1.at n=17A287324
• Numbers k such that (8*10^k - 83)/3 is prime.at n=17A293851
• Number of n X n 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.at n=5A296321
• Number of nX6 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1s.at n=5A296325
• T(n,k) = Number of n X k 0..1 arrays with each 1 horizontally, vertically or antidiagonally adjacent to 2 neighboring 1's.at n=60A296327
• Sum of the positive differences of the cubed parts in each partition of n into two parts.at n=17A335639
• Expansion of e.g.f. (1/x) * Series_Reversion( x/(1 - 2*log(1-x)) ).at n=5A377789