42375

Appears in sequences

• Fermat coefficients.at n=22A000970
• a(n) = floor(C(n,4)/5).at n=49A011795
• Define the sequence S(a_0,a_1) by a_{n+2} is the least integer such that a_{n+2}/a_{n+1}>a_{n+1}/a_n for n >= 0. This is S(3,6).at n=12A018909
• Numbers k such that the decimal expansion of k^2 consists of two squares that overlap in 2 digits.at n=2A048424
• a(n) = T(n,5), array T as in A051168; a count of Lyndon words; aperiodic necklaces with 5 black beads and n-5 white beads.at n=45A051170
• Numbers k = concat(s,t) such that k = (Fibonacci(s) mod k) * (Fibonacci(t) mod k).at n=8A272770
• a(n) is the cyclic length of the iterative sequence f(k) = prime(f(k-1) mod 2^n) with f(0) = 1.at n=32A326613
• Number of reversed integer partitions y of n with exactly one fixed point y(i) = i.at n=43A352832