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.

A263027 a(n) = A002322(n) + 1, where A002322 is Carmichael lambda.

Original entry on oeis.org

2, 2, 3, 3, 5, 3, 7, 3, 7, 5, 11, 3, 13, 7, 5, 5, 17, 7, 19, 5, 7, 11, 23, 3, 21, 13, 19, 7, 29, 5, 31, 9, 11, 17, 13, 7, 37, 19, 13, 5, 41, 7, 43, 11, 13, 23, 47, 5, 43, 21, 17, 13, 53, 19, 21, 7, 19, 29, 59, 5, 61, 31, 7, 17, 13, 11, 67, 17, 23, 13, 71, 7
Offset: 1

Views

Author

Vincenzo Librandi, Oct 08 2015

Keywords

Comments

The function t(k,n) = A002322(n)+k provides many prime values for k=1: for n up to 1000, for example, it returns 798 primes (with repetitions). On the other hand, for n <= 1000 and odd k from 3 to 11, t(k,n) gives 247, 387, 538, 231, 504 prime values, respectively.
Another function of this type is |A002322(n)-119|, which provides 693 prime values for n <= 1000. [Bruno Berselli, Oct 14 2015]

Crossrefs

Cf. A002322.
Cf. A263028: indices n for which a(n) is prime.
Cf. A263029: indices n for which a(n) is composite.
Cf. also A039649, A296076, A296077.

Programs

  • Magma
    [2] cat [CarmichaelLambda(n)+1: n in [2..100]];
    
  • Mathematica
    Table[CarmichaelLambda[n] + 1, {n, 1, 100}]
  • PARI
    vector(100, n, 1 + lcm(znstar(n)[2])) \\ Altug Alkan, Oct 08 2015

Extensions

Edited by Bruno Berselli, Oct 14 2015