30043

Appears in sequences

• Start with 1 and repeatedly reverse the digits and add 42 to get the next term.at n=33A118075
• a(0)=a(1)=1. For n >= 2, if a(n-1) is coprime to n, then a(n) = a(n-1) + a(n-2). Otherwise, a(n)=1.at n=51A139047
• Number of n X n binary arrays symmetric under 90 degree rotation with all ones connected only in a 1000-1111-0001 pattern in any orientation.at n=15A146608
• a(n) is the sum over all proper integer partitions with distinct parts of n of the previous terms.at n=15A214952
• Irregular triangular array T(n,k) of consecutive composites.at n=40A226085
• Number of compositions of n into distinct parts with exactly one descent.at n=36A241720
• Number of length n+3+1 0..3 arrays with every value 0..3 appearing at least once in every consecutive 3+2 elements, and new values 0..3 introduced in order.at n=12A242234
• Records in A098550.at n=46A248647
• Composite numbers whose concatenation of their aliquot parts, in ascending order, is a palindrome.at n=39A249300
• Values of A098550 where A098550(k)/k reaches a record high.at n=15A251415
• a(n) = Fibonacci(n+1)^3 - Fibonacci(n)^3.at n=8A346513
• a(n) = prime(n)# + prime(n), where prime(n)# is the n-th primorial number A002110(n).at n=5A352002
• Numbers k such that A003415(k) >= A276086(k) and gcd(k, A003415(k)) = gcd(k, A276086(k)), where A003415 is the arithmetic derivative, and A276086 is the primorial base exp-function.at n=22A369959
• Numbers k such that (A276086(k)/s)^s >= k^(s-1) and A276086(k) <= A003415(k), where A003415 is the arithmetic derivative, A276086 is the primorial base exp-function, and s = bigomega(k).at n=23A370128
• Intersection of A392605 and A392611.at n=34A392606