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.

A347355 Index of first n in A347354.

Original entry on oeis.org

1, 2, 4, 5, 8, 10, 13, 18, 23, 24, 27, 32, 35, 39, 40, 50, 53, 54, 62, 67, 70, 73, 85, 89, 94, 99, 100, 104, 105, 115, 129, 132, 134, 140, 143, 153, 157, 159, 170, 173, 175, 180, 184, 188, 192, 194, 199, 229, 233, 235, 238, 248, 249, 254, 267, 275, 283, 289, 294
Offset: 1

Views

Author

Michael De Vlieger, Sep 28 2021

Keywords

Comments

Indices of records in A347354, where the record is A000027(n).
List of k such that A089576(k) = A089576(k-1) + 1.

Examples

			Relation of A347354 and irregular triangle A347285, placing "." after the last term in the current row where T(n,k) exceeds T(n-1,k). Since the rows of A347285 reach a fixed point of 0, we interpret T(n,k) for vacant T(n-1,k) as exceeding same. The indices n that are highlighted with parentheses are the terms in this sequence.
    n     Row n of A347285     A347354(n)
   --------------------------------------
    0:    0
   (1):   1.                   1
   (2):   2  1.                2
    3:    3. 1                 1
   (4):   4  2  1.             3
   (5):   5  3  2  1.          4
    6:    6. 3  2  1           1
    7:    7  4. 2  1           2
   (8):   8  5  3  2  1.       5
    9:    9. 5  3  2  1        1
  (10):  10  6  4  3  2  1.    6
  ...
		

Crossrefs

Programs

  • Mathematica
    Block[{nn = 300, a = {1}, c, e, m}, e[1] = 0; Do[c = 1; e[1]++; Do[Set[m, j]; Which[e[j - 1] == 1, Break[], IntegerQ@ e[j], If[e[j] < #, e[j]++; c++] &@ Floor@ Log[Prime[j], Prime[j - 1]^e[j - 1]], True, Set[e[j], 1]], {j, 2, k}]; If[c == m - 2, AppendTo[a, k - 1]], {k, 2, nn}]; Delete[a, {3}]]