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.

A115177 Positive numbers that are not the sum of a triangular number, a nonnegative cube and a positive Fibonacci number.

This page as a plain text file.
%I A115177 #14 Mar 09 2018 02:50:00
%S A115177 690,861,915,929,1201,1319,1451,1538,1578,1803,1965,2104,2427,2532,
%T A115177 2573,2671,2680,2734,2769,2965,3001,3154,3175,3255,3259,3260,3336,
%U A115177 3434,3476,3603,3628,3670,3805,3840,3847,3898,3903,3953,4050,4128
%N A115177 Positive numbers that are not the sum of a triangular number, a nonnegative cube and a positive Fibonacci number.
%C A115177 There are 225943534 such numbers up to 10^9, the last one in this range being 999999997.
%H A115177 Robert Israel, <a href="/A115177/b115177.txt">Table of n, a(n) for n = 1..10000</a>
%p A115177 N:=10000: # to get all terms <= N
%p A115177 T:= [seq(t*(t+1)/2, t=0..floor((sqrt(1+8*N)-1)/2))]:
%p A115177 C:= [seq(t^3, t=0..floor(N^(1/3)))]:
%p A115177 F:= [seq(combinat:-fibonacci(t), t=1..floor(log[(sqrt(5)+1)/2](N*sqrt(5))))]:
%p A115177 CF:= select(`<=`,{seq(seq(c+f, c=C),f=F)},N):
%p A115177 sort(convert({$1..N} minus {seq(seq(t+cf,t=T),cf=CF)}, list)); # _Robert Israel_, Mar 08 2018
%Y A115177 Cf. A115171, A115172, A115173, A115174, A115175, A115176.
%K A115177 nonn
%O A115177 1,1
%A A115177 _Giovanni Resta_, Jan 15 2006
%E A115177 Name clarified by _Altug Alkan_, May 02 2016