255987

Appears in sequences

• Recamán's Fibonacci variation : a(1)=a(2)=1 then a(n) = a(n-1)+a(n-2)-F(n) if that number is >0 and not already in the sequence; a(n) = a(n-1)+a(n-2)+F(n) otherwise where F(n) denotes the n-th Fibonacci number.at n=30A091484
• Half the number of 0..n arrays of length 4 with second differences nonzero.at n=25A212783
• Numbers, when written in binary, that are a proper substring of the concatenation (with repetition) in increasing order of their prime factors, when written in binary.at n=16A378894
• Composite numbers that are equal to the concatenation of the primes and exponents in their prime factorizations in some bases.at n=13A384537
• Numbers in A384537 that are not prime powers: composite numbers, not being prime powers, that are equal to the concatenation of the primes and exponents in their prime factorizations in some bases.at n=2A384540