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.

A214633 a(1)=2; a(n) is smallest prime of the form k*a(n-1) + 3, k>0.

Original entry on oeis.org

2, 5, 13, 29, 61, 491, 3931, 15727, 157273, 314549, 4403689, 17614759, 387524701, 5425345817, 119357607977, 9787323854117, 78298590832939, 1722568998324661, 68902759932986443, 4685387675443078127, 318606361930129312639, 637212723860258625281
Offset: 1

Views

Author

Robin Garcia, Jul 23 2012

Keywords

Crossrefs

Programs

  • Maple
    A214633 := proc(n)
        option remember;
        local k;
        if n =  1 then
            2;
        else
            for k from 1 do
                if isprime(k*procname(n-1)+3) then
                    return k*procname(n-1)+3 ;
                end if;
            end do:
        end if;
    end proc:
    seq(A214633(n),n=1..20) ; # R. J. Mathar, Jul 23 2012