61167

Appears in sequences

• Cellular automaton with Rule 230: 000, 001, 010, 011, ..., 111 -> 0,1,1,0,0,1,1,1.at n=15A006977
• 2-ranks of difference sets constructed from Glynn type I hyperovals.at n=17A049112
• a(0) = 0 and a(n) = (5*(-4)^n + 16*(-1)^n + 9*4^n)/240 for n >= 1.at n=10A113968
• a(n) = n^4 - n^3 - n^2 - n - 1.at n=16A125082
• a(0)=1, a(1)=2; for n>1, a(n)=3*a(n-1)+4*a(n-2)+5.at n=8A126019
• a(n) = Sum_{d|n} (-1)^(n/d+1)*d^4.at n=15A284900
• Numbers k such that (49*10^k - 67)/9 is prime.at n=22A291609
• To get a(n), replace 0's in the binary expansion of n with (-1) and interpret the result in base n.at n=16A360096
• a(n) = Sum_{1 <= x_1, x_2, x_3 <= n} n/gcd(x_1, x_2, x_3, n).at n=15A372952