29790

Appears in sequences

• a(n) = number of (s(0), s(1), ..., s(n)) such that every s(i) is an integer, s(0) = 0, |s(i) - s(i-1)| = 1 for i = 1,2; |s(i) - s(i-1)| <= 1 for i >= 3, s(n) = 1. Also a(n) = T(n,n-1), where T is the array defined in A024996.at n=11A024998
• a(n) = Sum_{k=0..2n-1} T(n,k) * T(n,k+1), with T given by A025177.at n=5A027258
• Numbers k such that k^2 has digits in nonincreasing order.at n=39A028821
• a(n) = Sum_{d|n, n/d=1 mod 4} d^3 - Sum_{d|n, n/d=3 mod 4} d^3.at n=30A050471
• Jordan function J_3(n).at n=30A059376
• a(n) = n^3 - 1.at n=30A068601
• Numbers sandwiched between two numbers having only one prime divisor (at least) one of which is composite.at n=33A088072
• n^3 - 1 divided by its largest cube divisor.at n=29A128972
• Positive X-values of solutions to the equation 1!*X^4 - 2!*(X + 1)^3 + 3!*(X + 2)^2 - (4^2)*(X + 3) + 5^2 = Y^3.at n=30A135300
• Half the number of length n integer sequences with sum zero and sum of squares 7688.at n=3A157594
• a(n) = 961*n - 1.at n=30A158412
• Numbers n with following property: let c = nearest cube to n that is different from n and let p = nearest prime to n that is different from n. Then |n-c| = |n-p|.at n=29A163497
• Numbers such that the two adjacent integers are a perfect cube and a prime.at n=8A164834
• Order of Fibonacci group F(n,3) (or 0 if the group is infinite).at n=30A202625
• a(n) = Sum_{0<=i<j<k<=n} L(i)*L(j)*L(k), where L(m) is the m-th Lucas number A000032(m).at n=7A213807
• Number of partitions of n such that m(greatest part) = m(1), where m = multiplicity.at n=51A240078
• Number of length n+2 0..6 arrays with no pair in any consecutive three terms totalling exactly 6.at n=3A245993
• T(n,k)=Number of length n+2 0..k arrays with no pair in any consecutive three terms totalling exactly k.at n=39A245995
• Number of length 4+2 0..n arrays with no pair in any consecutive three terms totalling exactly n.at n=5A245999
• Smallest magic constant of most-perfect magic squares of order 2n composed of distinct prime numbers.at n=1A258082