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 A277726 #12 Nov 02 2016 12:54:46 %S A277726 0,6,37,43,74,87,118,155,186,192,199,230,236,267,280,304,311,317,348, %T A277726 385,392,416,429,460,466,497,504,510,541,578,622,659,690,696,703,734, %U A277726 740,771,784,808,815,852,889,896,920,933,964,970,1001,1008,1014,1045,1082,1126,1163,1194,1200,1207,1238,1244,1275,1288,1312,1319,1356,1387,1393,1400,1424 %N A277726 Intersection of A277722 and A277723. %C A277726 See A277728 for discussion. %p A277726 Digits := 120; %p A277726 isA277722 := proc(n) %p A277726 a276800 := 3.3829757679062374941227085364550345869493820437485761820195626772353718960099402922235933340043661396041006 ; %p A277726 for x from floor((n-3)/a276800) to (n+3)/a276800 do %p A277726 if floor(x*a276800) = n then %p A277726 return true; %p A277726 end if; %p A277726 end do: %p A277726 return false; %p A277726 end proc: %p A277726 isA277723 := proc(n) %p A277726 a276801 := 6.2222625231203986266745611011083211873735607898461684287983213166395751180919067179620287534326731537460804; %p A277726 for x from floor((n-3)/a276801) to (n+3)/a276801 do %p A277726 if floor(x*a276801) = n then %p A277726 return true; %p A277726 end if; %p A277726 end do: %p A277726 return false; %p A277726 end proc: %p A277726 isA277726 := proc(n) %p A277726 isA277722(n) and isA277723(n) ; %p A277726 end proc: %p A277726 for n from 0 to 8000 do %p A277726 if isA277726(n) then %p A277726 printf("%d,",n) ; %p A277726 end if; %p A277726 end do: # _R. J. Mathar_, Nov 02 2016 %Y A277726 Cf. A003144, A003145, A003146, A058265, A158919, A275926, A276799, A276800, A277722, A277723, A277724, A277725, A277726, A277727, A277728. %K A277726 nonn %O A277726 1,2 %A A277726 _N. J. A. Sloane_, Oct 30 2016 %E A277726 Corrected by _R. J. Mathar_, Nov 01 2016