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.

Showing 1-2 of 2 results.

A335117 Records in A304480.

Original entry on oeis.org

1, 3, 25, 241, 505, 65521, 131041, 171865, 138181681, 6814407601, 20174525281, 45185409361, 558781423201, 685933859521, 2601256998740401, 4578654981700801, 15571124394460034401, 375159113055066740401, 124708934978441512498801, 127589793288205521873601, 8644416283014847832296801, 29217965124687229769336641
Offset: 1

Views

Author

Seiichi Manyama, May 24 2020

Keywords

Crossrefs

Formula

a(n) = A304480(A335116(n)).
a(n) = A335128(n-1)+1 for n > 2.

A304480 a(n) is the least m such that lambda(k) >= n for all k >= m where lambda is A002322, the Carmichael lambda function.

Original entry on oeis.org

1, 3, 25, 25, 241, 241, 505, 505, 505, 505, 505, 505, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 65521, 131041, 131041, 131041, 131041, 131041, 131041, 171865, 171865, 171865, 171865, 171865, 171865, 138181681, 138181681, 138181681, 138181681, 138181681, 138181681
Offset: 1

Views

Author

Michel Marcus, May 13 2018

Keywords

Crossrefs

Programs

  • PARI
    minvl(n, v) = {vgt = select(x->(x>=n), v, 1); first = vgt[1]; vgtd = vector(#vgt-1, k, vgt[k+1] - vgt[k]); vgtdr = Vecrev(vgtd); vokdiff = select(x->x!=1, vgtdr, 1); if (#vokdiff, #v - vokdiff[1]+1, first);}
    lista(nn) = {v = read("v002322.txt"); for (n=1, nn, print1(minvl(n, v), ", "););}

Extensions

a(32) and beyond from Seiichi Manyama, May 24 2020
Showing 1-2 of 2 results.