cp's OEIS Frontend

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.

A135709 Not the sum of three distinct nonzero Fibonacci numbers.

This page as a plain text file.
%I A135709 #11 Sep 08 2019 14:39:29
%S A135709 1,2,3,4,5,7,33,46,51,53,54,67,72,74,75,80,82,83,85,86,87,88,101,106,
%T A135709 108,109,114,116,117,119,120,121,122,127,129,130,132,133,134,135,137,
%U A135709 138,139,140,141,142,143,156,161,163,164,169,171,172,174,175,176,177,182,184,185
%N A135709 Not the sum of three distinct nonzero Fibonacci numbers.
%H A135709 R. J. Mathar, <a href="/A135709/b135709.txt">Table of n, a(n) for n = 1..1000</a>
%H A135709 Colm Mulcahy, <a href="http://www.maa.org/community/maa-columns/past-columns-card-colm/additional-certainties">Additional Certainties</a>, MAA, Feb 2008
%p A135709 # needs isA135558 from A135558
%p A135709 A135709 := proc(n)
%p A135709     option remember;
%p A135709     local a;
%p A135709     if n = 1 then
%p A135709         1;
%p A135709     else
%p A135709         for a from procname(n-1)+1 do
%p A135709             if not isA135558(a) then
%p A135709                 return a;
%p A135709             end if;
%p A135709         end do:
%p A135709     end if;
%p A135709 end proc: # _R. J. Mathar_, Sep 09 2015
%t A135709 With[{f=15},Complement[Range[Fibonacci[f]],Total/@Subsets[Fibonacci[ Range[ 2,f]],{3}]]] (* _Harvey P. Dale_, Sep 08 2019 *)
%Y A135709 Complement of A135558.
%Y A135709 Cf. A179244, A111458.
%K A135709 nonn
%O A135709 1,2
%A A135709 _N. J. A. Sloane_, Mar 05 2008