23283

Appears in sequences

• s(1)t(n) + s(2)t(n-1) + ... + s(k)t(n+1-k), where k = [ (n+1)/2 ], s = (odd natural numbers), t = A001950 (upper Wythoff sequence).at n=36A024600
• a(n) = Sum_{k=0..n} (k+1) * A026615(n,k).at n=11A026960
• a(n)-th and (a(n)+1)-st primes are the first pair of primes that differ by exactly 2n; a(n) = -1 if no such pair of primes exists.at n=40A038664
• a(n) is the least positive integer k such that g(k) = n*g(k-1), where g(k) = prime(k+1) - prime(k).at n=40A078563
• Numbers where A080374 increases.at n=20A080376
• Floor((x^n - (1-x)^n)/sqrt(3)+.5) where x = (sqrt(3)+1)/2.at n=33A136422
• Terms of A024670 that are not in A141805.at n=34A141806
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of 2 n steps taken from {(-1, -1), (-1, 0), (1, 0), (1, 1)}.at n=5A151388
• Number of walks within N^2 (the first quadrant of Z^2) starting at (0,0), ending on the vertical axis and consisting of n steps taken from {(-1, -1), (0, -1), (0, 1), (1, 1)}.at n=10A151396
• Least number x such that there are n numbers of the form 6k-1 or 6k+1 between prime(x) and prime(x+1).at n=26A213903
• a(n) = Sum_{i=0..n} digsum_8(i)^3, where digsum_8(i) = A053829(i).at n=54A231682
• a(n)=position of the first occurrence of a local maximum equal to 2n in A001223, n>1.at n=39A286729
• Number T(n,k) of permutations of [n] for which the difference between the longest and the shortest cycle length is k; triangle T(n,k), n>=0, 0<=k<=max(0,n-2), read by rows.at n=31A364967
• Triangle read by rows: the polynomial coefficients of the numerator of the rational solution of the linear recurrence equations of the rows of A371761.at n=32A371762
• a(n) is the least k such that the number of integers between (1/4)*prime(k) and (1/4)*prime(k+1) is n.at n=19A390785