This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
%I A101422 #4 Mar 30 2012 18:40:00 %S A101422 1,1,1,2,1,2,2,2,1,2,1,3,2,3,1,2,3,2,2,3,1,2,3,3,2,3,1,2,3,3,2,3,3,2, %T A101422 3,3,2,3,3,2,1,3,2,3,1,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,3, %U A101422 3,2,3,3,2,3,3,2,3,3,2,3,1,2,3,3,2,3,3,2,3,3,2,3,3,2,3,3,2,2,3,2,3,3,2,2,3 %N A101422 Minimal number of primes needed to sum to Fibonacci(n). %F A101422 a(n) = A051034(A000045(n)). %e A101422 a(5)=1 because Fibonacci(5)=5 is a prime. %e A101422 a(6)=2 because Fibonacci(6)=8 = 3+5. %e A101422 a(7)=1 because Fibonacci(7)=13 is a prime. %e A101422 a(14)=3 because Fibonacci(14)=377 = 2+2+373. %Y A101422 Cf. A000045, A051034, A001605, A102106, A102107. %K A101422 nonn %O A101422 3,4 %A A101422 _Giovanni Teofilatto_, Jan 17 2005 %E A101422 Edited and extended by _Ray Chandler_, Jan 18 2005