69906
domain: N
Appears in sequences
- Numbers whose set of base-16 digits is {1,2}.at n=31A032936
- Numbers whose base-4 representation has exactly 9 runs.at n=1A043600
- Numbers n such that number of runs in the base 4 representation of n is congruent to 1 mod 8.at n=25A043851
- Numbers n such that number of runs in the base 4 representation of n is congruent to 0 mod 9.at n=1A043858
- Numbers k such that number of runs in the base 4 representation of k is congruent to 9 mod 10.at n=1A043876
- a(n)=a(n-1)+a(n-2)+a(n-3)+2a(n-4).at n=20A139800
- Number of (n+3) X (1+3) 0..1 arrays with each row and column divisible by 15, read as a binary number with top and left being the most significant bits.at n=16A262450
- Number of integer compositions of n that have only one part or whose consecutive parts are indivisible and the last and first part are also indivisible.at n=32A318726
- a(n) = Sum_{d|n} phi(d)^4.at n=31A342470
- a(n) = Sum_{k=0..n} binomial(n+4*k,n-k) * Catalan(k).at n=7A360103
- Number of distinct residues x^4 (mod 2^n), x=0..2^n-1.at n=20A364811
- Number of distinct quartic residues x^4 (mod 4^n), x=0..4^n-1.at n=10A365103