23544

Appears in sequences

• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 29 ones.at n=8A031797
• a(n) = floor(n^3 / e).at n=40A032636
• Star of David matchstick numbers: a(n) = 6*n*(3*n+1).at n=36A045946
• a(n) = floor(Pi^n mod n^Pi).at n=25A066434
• Square root of n-th perfect square in A083356.at n=7A083358
• Numbers with at least two 3s in their prime signature.at n=56A109399
• Difference between the product of two consecutive primes and the next prime.at n=35A111071
• a(n) = 3*a(n-1) + 3*a(n-2), n>2, a(0)=1, a(1)=2, a(2)=8.at n=8A155116
• The sequence of coefficients of a polynomial recursion: p(x,n)=If[Mod[n, 2] == 0, (x + 1)*p(x, n - 1), (x^2 + (2*n)*x + 1)^Floor[n/2]].at n=39A171147
• The sequence of coefficients of a polynomial recursion: p(x,n)=If[Mod[n, 2] == 0, (x + 1)*p(x, n - 1), (x^2 + (2*n)*x + 1)^Floor[n/2]].at n=41A171147
• Triangle read by rows: number of permutation trees of power n and height <= k + 1.at n=31A179455
• Number of 3-step one or two space at a time bishop's tours on an n X n board summed over all starting positions.at n=22A187047
• Number of maps f: [n] -> [n] with f(x)<=x and f(f(x)) = f(f(f(x))).at n=8A187761
• Coefficient triangle of the associated Laguerre polynomials of order 1.at n=23A199577
• Triangle read by rows: T(n,k) (n >= 2, 1 <= k <= n-1) = Euclidean distance degree of variety of n X n matrices of rank <= k.at n=12A232496
• Triangle read by rows, Bell transform of second order Bell numbers (A187761).at n=46A264430
• Square array read by ascending antidiagonals, Bell numbers iterated by the Bell transform.at n=63A265312
• Least common multiple of 7*n+1 and 7*n-1.at n=31A282286
• a(n) = 9*n^2 + 21*n - 6 (n>=1).at n=49A304374
• Consider all 3 X 3 matrices M whose entries are the n-th to (n+8)-th primes prime(n), ..., prime(n+8), in any order. a(n) is the sum of the number of M such that det(M) is divisible by prime(n+i), for i from 0 to 8.at n=29A339105