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 A168382 #19 Dec 11 2019 02:34:00 %S A168382 3,4,8,24,74,444,1600,15684,29400,50124,259224,5332128,11110428, %T A168382 50395440,451174728,1296895890,13314115434,32868437466,326585290794, %U A168382 4788143252148 %N A168382 Least number k having n distinct representations as the sum of a nonzero Fibonacci number and a prime. %C A168382 The meaning of "distinct" is the following: we count ordered index pairs (i,j) with k = Fibonacci(i) + prime(j), i > 1, j >= 1. %C A168382 Fibonacci(1) + prime(4) = Fibonacci(2) + prime(4) = Fibonacci(4) + prime(3) = Fibonacci(5) + prime(2) = 8 are three "distinct" representations of k=8, because Fibonacci(1) = Fibonacci(2) is treated as indistinguishable, whereas Fibonacci(4) = prime(2) are distinguishable based on the ordering in the indices (ordering in the sum): k = 1+7 = 3+5 = 5+3. %C A168382 a(17) > 10^10. [_Donovan Johnson_, May 17 2010] %D A168382 J. Earls, "Fibonacci Prime Decompositions," Mathematical Bliss, Pleroma Publications, 2009, pages 76-79. ASIN: B002ACVZ6O %e A168382 15684 is the least number having eight distinct representations due to the following sums: 1 + 15683 = 5 + 15679 = 13 + 15671 = 55 + 15629 = 233 + 15451 = 377 + 15307 = 1597 + 14087 = 4181 + 11503. %Y A168382 Cf. A132144, A169790, A169791. %K A168382 more,nonn %O A168382 1,1 %A A168382 _Jason Earls_, Nov 24 2009 %E A168382 Two more terms from _R. J. Mathar_, Feb 07 2010 %E A168382 a(7) corrected by _Jon E. Schoenfield_, May 14 2010 %E A168382 Edited by _R. J. Mathar_, May 14 2010 %E A168382 a(11)-a(14) from _Max Alekseyev_, May 15 2010 %E A168382 a(15)-a(16) from _Donovan Johnson_, May 17 2010 %E A168382 a(17) from _Chai Wah Wu_, Sep 04 2018 %E A168382 a(18)-a(20) from _Giovanni Resta_, Dec 10 2019