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-1 of 1 results.

A276641 Number of digits in 2^A000668(n)-1.

Original entry on oeis.org

1, 3, 10, 39, 2466, 39457, 157827, 646456993, 694127911065419642, 186328542329173367306815834, 48844909400338823199277929902126, 51217599719369681875006054625051616350
Offset: 1

Views

Author

Felix Fröhlich, Sep 22 2016

Keywords

Comments

The sequence is a subsequence of A227683.

Crossrefs

Programs

  • PARI
    next_a000668(n) = my(expo=nextprime(ceil(log(n+1)/log(2)))); while(!ispseudoprime(2^expo-1), expo=nextprime(expo+1)); 2^expo-1
    terms(n) = my(p=3, i=0); while(i < n, print1(#Str(2^p-1), ", "); i++; p=next_a000668(p+1))
    terms(7) \\ print initial seven terms

Formula

a(n) = A055642(A000225(A000668(n))).

Extensions

a(8)-a(12) from Ivan Panchenko, Apr 11 2018
Showing 1-1 of 1 results.