28623

Appears in sequences

• Expansion of 1/((1-x)*(1-3*x)*(1-4*x)*(1-5*x)).at n=5A021344
• Fibonacci sequence beginning 0, 29.at n=16A022363
• Divide odd numbers into groups with prime(n) elements and add together.at n=14A034960
• a(n)=Sum((-1)^(i+Floor(n/2))S(2i+e),(i=0,..,Floor(n/2))), where S(n) are generalized Tetranacci numbers (A073817) and e=(1/2)(1-(-1)^n).at n=16A075112
• Numbers n such that (n / sum of digits of n) is a golden semiprime.at n=15A108780
• a(n) = Fibonacci(n+9) - Fibonacci(9).at n=14A180674
• s(k)-s(j), where the pairs (k,j) are given by A205862 and A205863, and s(k) denotes the (k+1)-st Fibonacci number.at n=30A205864
• a(n) = gcd(Sum_{k=1...n} L(k), Product_{j=1...n} L(j)), where L(k) is the k-th Lucas number.at n=27A239799
• Expansion of Sum_{i>=1} mu(i)^2*i*x^i/(1 - x^i) / Product_{j>=1} (1 - x^j), where mu() is the Moebius function (A008683).at n=23A281904
• Odd composite integers m such that A000045(2*m-J(m,5)) == 1 (mod m), where J(m,5) is the Jacobi symbol.at n=26A340118
• E.g.f. satisfies log(A(x)) = (exp(x * A(x)) - 1)^2 / 2.at n=7A357031