26567

Appears in sequences

• a(n) = prime(n)^2 - 2.at n=37A049001
• Erroneous version of A134915.at n=9A076884
• 2*JacobiSymbol(p,5) mod p^2 for p=prime(n).at n=37A113651
• a(n) = a(n-1) + 7*a(n-2) for n >= 2, a(0)=1, a(1)=2.at n=9A133469
• a(n) = ceiling(A173497(n)/2).at n=34A173508
• Total number of parts that are the smallest part or the largest part in all partitions of n.at n=28A182978
• Position of 5^n in A051037 (5-smooth numbers).at n=35A188427
• Decimal representation of the x-axis, from the origin to the right edge, of the n-th stage of growth of the two-dimensional cellular automaton defined by "Rule 78", based on the 5-celled von Neumann neighborhood.at n=15A278789
• a(n) = 2*a(n-1) - a(n-2) + a(n-4), n>3, a(0)=0, a(1)=a(2)=1, a(3)=3.at n=22A286311
• Array read by diagonals downwards: A(n,k) for n>=2 and k>=0 is the number of (n,k)-polyominoes.at n=58A381030
• Upper (3/2)-midsequence of (F(2n)) and (F(2n+1)), where F=A000045 (Fibonacci numbers); see Comments.at n=10A387781
• Upper (1/2)-midsequence of F(n) and F(n+4), where F = A000045 (Fibonacci numbers); see Comments.at n=20A390351