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.

A343048 a(n) is the least number whose sum of digits in primorial base equals n.

Original entry on oeis.org

0, 1, 3, 5, 11, 17, 23, 29, 59, 89, 119, 149, 179, 209, 419, 629, 839, 1049, 1259, 1469, 1679, 1889, 2099, 2309, 4619, 6929, 9239, 11549, 13859, 16169, 18479, 20789, 23099, 25409, 27719, 30029, 60059, 90089, 120119, 150149, 180179, 210209, 240239, 270269
Offset: 0

Views

Author

Rémy Sigrist, Apr 05 2021

Keywords

Comments

Equivalently, this sequence gives positions of records in A276150.

Examples

			The first terms, alongside their primorial base representation, are:
  n   a(n)  prim(a(n))
  --  ----  ----------
   0     0           0
   1     1           1
   2     3          11
   3     5          21
   4    11         121
   5    17         221
   6    23         321
   7    29         421
   8    59        1421
   9    89        2421
  10   119        3421
  11   149        4421
  12   179        5421
  13   209        6421
  14   419       16421
  15   629       26421
		

Crossrefs

One less than A060735.
Cf. also A372559.

Programs

  • PARI
    a(n) = my (v=0, pp=1); forprime (p=2, oo, if (n==0, return (v), my (d=min(p-1, n)); n-=d; v+=d*pp; pp*=p))

Formula

A276150(a(n)) = n.
a(n) = A060735(n)-1. - Antti Karttunen, Nov 14 2024