22814

Appears in sequences

• a(1)=1, a(n) is the smallest integer > a(n-1) such that the largest element in the simple continued fraction for S(n)=1/a(1)+1/a(2)+...+1/a(n) equals prime(n).at n=30A070901
• Number of Dyck paths of semilength n for which the number of ascents of length 1 is equal to the number of descents of length 1.at n=11A112412
• Integer part of 7th root of product of first n primes.at n=21A127604
• Consider the partitions of n in reverse lexicographic ordering (A080577), a(n) is the position of the partition of n which has the maximum LCM. See A000793.at n=42A213952
• Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 115", based on the 5-celled von Neumann neighborhood.at n=31A270183
• G.f. = (1-3*x+x^2)^3*(1+3*x+x^2)^3*(1-x^2)^10/((1-4*x-x^2)*(1-x-x^2)^6*(1+x-x^2)^9).at n=8A324486
• Even composite integers m such that U(m)^2 == 1 (mod m) and V(m) == 7 (mod m), where U(m)=A004187(m) and V(m)=A056854(m) are the m-th generalized Lucas and Pell-Lucas numbers of parameters a=7 and b=1, respectively.at n=37A337782
• a(n) = Sum_{d|n} d * (n/d)^d.at n=21A359103
• Numbers k such that k^2, (k+1)^2 and (k+2)^2 are all abundant numbers.at n=9A383391