26840

Appears in sequences

• Glaisher's function J(n) (18 squares version).at n=9A002613
• Numbers k such that sigma(k) = sigma(k+10).at n=28A015880
• Smallest Fibonacci number that has n as a factor, divided by n.at n=30A037943
• Number of directed loopless multigraphs with n arcs.at n=7A052170
• Triangle, read by rows, where the n-th row lists the (2n+1) coefficients of (1+2*x+3*x^2)^n.at n=56A084608
• Coefficients of 1/sqrt(1-4*x-8*x^2); also, a(n) is the central coefficient of (1+2*x+3*x^2)^n.at n=7A084609
• Expansion of g.f. Product((1+x^i)/(1-x^i),i=1..n-1)/(1-x^n), with n = 6.at n=34A091774
• Fibonacci quotients: Fibonacci(p - Legendre(p|5))/p where p runs through the primes.at n=10A092330
• Numbers of the form Fibonacci(p-1)/p, where p are primes ending in 1 or 9 (i.e., A045468).at n=3A094808
• Row sums of the triangle A105160.at n=16A105157
• Divide each Fibonacci number by its primitive part.at n=29A105602
• Sum of primes between n and n^2.at n=23A109818
• Square array of expansions of 1/sqrt(1-4x-4*k*x^2), read by antidiagonals.at n=47A110135
• a(n) = gcd(F(n), product{k|n,k<n} F(k)), where F(k) is k-th Fibonacci number.at n=29A111079
• a(n) = (prime(n)^5 - prime(n))/6.at n=4A138427
• Let p = prime(n). Then a(n) = Fibonacci(p+1)/p if this is an integer, otherwise a(n) = Fibonacci(p-1)/p if this is an integer, and fall back to a(n)=0 if both are non-integer.at n=10A176951
• a(n) = 8*a(n-1) - 3*a(n-2), with a(0)=0, a(1)=1.at n=6A190976
• Number of (n+2)X(3+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=6A252048
• Number of (n+2)X(7+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=2A252052
• T(n,k)=Number of (n+2)X(k+2) 0..3 arrays with every 3X3 subblock row and column sum not 1 3 6 or 8 and every diagonal and antidiagonal sum 1 3 6 or 8.at n=38A252053