954437177
domain: N
Appears in sequences
- Positions of remoteness 2 in Beans-Don't-Talk.at n=18A005698
- a(n) = (1 - (-8)^n)/9.at n=10A014990
- Gaussian binomial coefficient [ n,10 ] for q=-8.at n=1A015394
- a(n) = 7*a(n-1) + 8*a(n-2), a(0) = 0, a(1) = 1.at n=11A015565
- Cyclotomic polynomials at x=8.at n=22A019326
- Cyclotomic polynomials at x=-8.at n=11A020507
- Nearest integer to 2^(n-1)/n.at n=35A054650
- Squarefree part of 2^n+1 : the smallest number such that a(n)*(2^n+1) is a square.at n=33A069111
- Duplicate of A015565.at n=11A082310
- Expansion of x^3/(1 - 2*x + x^3 - 2*x^4) = x^3/( (1-2*x)*(1+x)*(1-x+x^2) ).at n=33A113405
- First differences of A131666.at n=33A131090
- First differences of (A113405 prefixed with a 0).at n=33A131666
- a(0)=1. a(n+1)=2*a(n)-A130151(n).at n=32A132780
- a(n) = 3 A113405(n)- A113405(n+1).at n=33A133511
- a(n) = 3*A131666(n) - A131666(n+1).at n=33A135259
- Smallest positive integer solution x of 9*x - 2^n*y = 1.at n=30A234038
- Smallest positive integer solution x of 9*x - 2^n*y = 1.at n=31A234038
- Smallest positive integer solution x of 9*x - 2^n*y = 1.at n=32A234038
- Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 9, read as a binary number with top and left being the most significant bits.at n=29A262333
- a(n) = Sum_{j=0..10} (-n)^j.at n=8A269486