22609

Appears in sequences

• a(n) is the smallest k > a(n-1) such that k^2 has no digit in common with a(n-1)^2.at n=47A030287
• Numbers k such that the period of the continued fraction for sqrt(k) contains exactly 86 ones.at n=30A031854
• Sums of distinct powers of 12.at n=29A033048
• Where records occur in A092419.at n=8A070040
• Triangle read by rows: T(n,k) is the number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having k DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=42A191397
• Number of dispersed Dyck paths of length n (i.e., Motzkin paths of length n with no (1,0)-steps at positive heights) having no DHU's (here U=(1,1), H=(1,0), and D=(1,-1)).at n=18A191398
• a(n) = (2^p+1)^(p-1) modulo p^2, where p is prime(n).at n=36A260531
• Expansion of Product_{k>=1} 1/(1 - (4*k-1)*x^(4*k-1)).at n=29A265828
• a(n) = a(n-1) + a(n-3) + a(n-4), where a(0) = 1, a(1) = 1, a(2) = 4, a(3) = -3.at n=25A295677
• a(n) is the least positive multiple of 2*n-1 containing only the digits 0 and 1 in base n.at n=11A337623
• Number of essentially series achiral series-parallel networks with n elements.at n=15A339157