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 A169790 #13 Apr 28 2019 18:17:29 %S A169790 3,4,10,24,74,444,1614,15684,29400,50124,259224,5332128,11110428, %T A169790 50395440,451174728,1296895890 %N A169790 Least number k having n unordered partitions into a nonzero Fibonacci number and a prime. %C A169790 Variant of A168382. %C A169790 Fibonacci(1) + prime(4) = Fibonacci(2) + prime(4) = Fibonacci(4) + prime(3) = Fibonacci(5) + prime(2) = 8 are two "distinct" representations of k=8, because Fibonacci(1) = Fibonacci(2) = 1 is treated as indistinguishable, and Fibonacci(4) = prime(2) = 3 are also indistinguishable: k = 1+7 = 3+5. %C A169790 This matters because of the existence of Fibonacci primes (see A005478). %C A169790 a(17) > 10^10. [_Donovan Johnson_, May 17 2010] %e A169790 1+443 = 5+439 = 13+431 = 55+389 = 233+211 = 377+67 are n=6 distinct representations of 444. %Y A169790 Cf. A168382, A169791. %K A169790 more,nonn %O A169790 1,1 %A A169790 _R. J. Mathar_ and _Jon E. Schoenfield_, May 14 2010 %E A169790 a(8)-a(14) from _Max Alekseyev_, May 15 2010 %E A169790 a(15)-a(16) from _Donovan Johnson_, May 17 2010 %E A169790 Prime index in the comment corrected by _R. J. Mathar_, Jun 02 2010