50942

Appears in sequences

• From a problem in AI planning: a(n) = 4+a(n-1)+a(n-2)+a(n-3)+a(n-4)-a(n-5)-a(n-6)-a(n-7), n>7.at n=17A007800
• a(n)=Mod(2^Fibonacci(n),Fibonacci(n)).at n=27A171244