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.

A277726 Intersection of A277722 and A277723.

Original entry on oeis.org

0, 6, 37, 43, 74, 87, 118, 155, 186, 192, 199, 230, 236, 267, 280, 304, 311, 317, 348, 385, 392, 416, 429, 460, 466, 497, 504, 510, 541, 578, 622, 659, 690, 696, 703, 734, 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
Offset: 1

Views

Author

N. J. A. Sloane, Oct 30 2016

Keywords

Comments

See A277728 for discussion.

Crossrefs

Programs

  • Maple
    Digits := 120;
    isA277722 := proc(n)
        a276800 :=  3.3829757679062374941227085364550345869493820437485761820195626772353718960099402922235933340043661396041006 ;
        for x from floor((n-3)/a276800) to (n+3)/a276800 do
            if floor(x*a276800) = n then
                return true;
            end if;
        end do:
        return false;
    end proc:
    isA277723 := proc(n)
        a276801 :=  6.2222625231203986266745611011083211873735607898461684287983213166395751180919067179620287534326731537460804;
        for x from floor((n-3)/a276801) to (n+3)/a276801 do
            if floor(x*a276801) = n then
                return true;
            end if;
        end do:
        return false;
    end proc:
    isA277726 := proc(n)
        isA277722(n) and isA277723(n) ;
    end proc:
    for n from 0 to 8000 do
        if isA277726(n) then
            printf("%d,",n) ;
        end if;
    end do: # R. J. Mathar, Nov 02 2016

Extensions

Corrected by R. J. Mathar, Nov 01 2016