33687

Appears in sequences

• a(1)=1 then a(n)= (1/2) *(5*a(n-1)+1) if a(n-1) is odd, a(n)=3/2*a(n-1) otherwise.at n=15A086813
• Integers of the form 8k+7 that can be written as a sum of four distinct squares of the form m, m+2, m+4, m+5, where m == 1 (mod 4).at n=22A243579
• a(n) = k is a number such that A007535(k), the smallest pseudoprime to base k ( > k), is the n-th Carmichael number.at n=10A293563
• G.f. A(x) = Sum_{n>=0} a(n)*x^n where a(n) = Sum_{k=0..n} ( [x^k] A(2*x)^(n+1) (mod 2^(n+1)) ) for n >= 0 with a(0) = 1.at n=12A371715