27060

Appears in sequences

• a(n) = lcm(n, Fibonacci(n)).at n=19A014965
• Number of (undirected) Hamiltonian paths in n-Moebius ladder.at n=30A020875
• Fibonacci sequence beginning 0, 4.at n=20A022087
• Number of binary rooted trees with n nodes and height exactly 9.at n=18A036598
• Denominators of continued fraction convergents to sqrt(226).at n=3A041421
• a(n) = Sum_{d|3} phi(d)*n^(3/d).at n=30A054602
• Triangle T(n,k) = binomial(n+2,k+1)*(binomial(n+2,k+1)-1), n >=0, 0 <= k <= n.at n=47A065420
• Row sums of Fibonacci triangle shown below.at n=5A087018
• Numbers n such that n^3 is the sum of three or more consecutive positive cubes.at n=15A097811
• Numbers n such that 4*10^n + 6*R_n - 5 is prime, where R_n = 11...1 is the repunit (A002275) of length n.at n=18A102994
• G.f.: x^2/((1-x^2)^2*Product_{i>0}(1-x^i)).at n=29A103650
• Row sums of triangle A131327.at n=19A131328
• a(n) = A051717(2n) + A051717(2n+1).at n=20A140812
• Number of n X n binary arrays symmetric under 180 degree rotation with all ones connected only in a 1001-1111-0110 pattern in any orientation.at n=11A147420
• a(n) = (b(m)-1)*b(m) = Sum_{n=b(m)+1,...,c(m)}n, b=A046174, c=A046175, m=n+1.at n=1A175410
• a(n) = (7*n + 3)*(7*n + 4).at n=23A177071
• s(k)-s(j), where (k,j) is the least pair for which n divides s(k)-s(j), and s(j)=Fibonacci(2j-1).at n=29A205446
• s(k)-s(j), where the pairs (k,j) are given by A205852 and A205853, and s(k) denotes the (k+1)-st Fibonacci number.at n=37A205854
• s(k)-s(j), where the pairs (k,j) are given by A205857 and A205858, and s(k) denotes the (k+1)-st Fibonacci number.at n=36A205859
• s(k)-s(j), where the pairs (k,j) are given by A205877 and A205878, and s(k) denotes the (k+1)-st Fibonacci number.at n=20A205879