116509

Appears in sequences

• Positions of remoteness 2 in Beans-Don't-Talk.at n=9A005698
• First differences of (A113405 prefixed with a 0).at n=20A131666
• a(0)=1. a(n+1)=2*a(n)-A130151(n).at n=19A132780
• Inverse binomial transform of A131666 after removing A131666(0) = 0.at n=19A135258
• a(n) = 2*a(n-1) - a(n-3) + 2*a(n-4).at n=17A135350
• Start with a(1) = 1, a(2) = 3, then a(n)*2^k = a(n+1) + a(n+2), with 2^k the smallest power of 2 (k>0) such that all terms a(n) are positive integers.at n=53A233526
• 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=16A262333
• a(n) is the least number such that sigma(a(n)) = sigma(R(a(n)))/n, where R(n) is the digit reverse of n and sigma(n) is the sum of the divisors of n.at n=8A284498
• a(n+3) = 2^n - a(n), a(0)=a(2)=1, a(1)=0 for n >= 0.at n=20A328881