3495253

Properties

Appears in sequences

• a(n) = a(n-1) + 2*a(n-2), a(0)=2, a(1)=3.at n=21A048573
• a(n+1) = smallest number not containing any digits of a(n), working in base 4.at n=25A049548
• a(n) = 4*a(n-1) + 1 with a(0) = 3.at n=10A072197
• Numbers k such that A081252(m)/m^2 has a local maximum for m = k.at n=21A081254
• a(n) is the index of F(n+1) at the unique occurrence of the ordered pair of reversed consecutive terms (F(n+1),F(n)) in Stern's diatomic sequence A002487, where F(k) denotes the k-th term of the Fibonacci sequence A000045.at n=21A086893
• a(n) is the least prime p such that exponent of highest power of 2 dividing 3p+1 equals n.at n=20A087964
• a(n) = 4*a(n-2) + 1 with a(1) = 0, a(2) = 3.at n=21A096773
• An inverse Catalan transform of J(2n).at n=19A100335
• Least primes of the form k 4^n + (4^n-1)/3.at n=10A127598
• A generalized Jacobsthal sequence.at n=20A159290
• Locations of row maxima in "crushed" version of Stern's diatomic array.at n=41A169969
• Least n such that L(n)<-1 and L(n)<L(n-1), where L(k) means the least root of the polynomial p(k,x) defined at A206284, and a(1)=13.at n=9A206444
• Odd numbers producing 3 decreasing odd numbers in the Collatz (3x+1) iteration.at n=33A228872
• Primes p such that the greatest prime factor of 3*p+1 is at most 5.at n=13A276827
• a(n) = 4*a(n-2)+1 with initial terms 1,3,7.at n=21A283323
• Numbers of the form (2^(2*j + 6*k + 5) - 2^(2*j + 1) - 3)/9, with j,k >= 0.at n=22A342815
• Prime numbersat n=249842