24500
domain: N
Appears in sequences
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or is not a Lucas number).at n=18A023497
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 3) and d(n) = (n-th number that is 1 or 2 or is not a Fibonacci number).at n=18A023498
- a(n) = b(n) + d(n), where b(n) = (n-th Lucas number > 1) and d(n) = (n-th number that is 1, 2, or 3, or is not a Lucas number).at n=19A023501
- dot product (n,n-1,...2,1).(3,4,...,n,1,2).at n=47A026054
- Numbers k such that 67*2^k+1 is prime.at n=30A032383
- Numbers k that can be expressed as k = w+x = y*z with w*x = k*(y+z) where w, x, y, and z are all positive integers.at n=34A057371
- Numbers k such that k and k^2 use only the digits 0, 2, 4, 5 and 6.at n=55A136898
- Numbers of the form p^3*q^2*r^2 where p, q, and r are distinct primes.at n=13A179695
- Floor(1/{(7+n^4)^(1/4)}), where {}=fractional part.at n=34A184631
- Triangle read by rows of products of (signless) Stirling numbers of the first kind (A132393) and Stirling numbers of the second kind (A008277).at n=33A187556
- Number of ways to place n nonattacking composite pieces queen + rider[4,5] on an n X n chessboard.at n=13A189881
- a(n) = 20*n^2.at n=35A195322
- Achilles number whose double is also an Achilles number.at n=26A203663
- Numbers n such that n*9^n - 1 is prime.at n=5A242202
- Partial sums of the number of active (ON, black) cells in n-th stage of growth of two-dimensional cellular automaton defined by "Rule 813", based on the 5-celled von Neumann neighborhood.at n=26A273640
- Decimal representation of the x-axis, from the left edge to the origin, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 481", based on the 5-celled von Neumann neighborhood.at n=17A282488
- Number of nonisomorphic proper colorings of partition multicycle graph using five colors.at n=80A298265
- Number of nonisomorphic proper colorings of partition multicycle graph using five colors.at n=90A298265
- Triangle read by rows: T(n,k) = binomial(n,k)^2 * binomial(2*(n-k), n-k).at n=32A318397
- Numbers such that the list of exponents of their factorization is a palindromic list of primes.at n=6A322525