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.

A309226 Index of n-th low point in A008348 (see Comments for definition).

Original entry on oeis.org

0, 3, 8, 21, 56, 145, 366, 945, 2506, 6633, 17776, 48521, 133106, 369019, 1028404, 2880287, 8100948, 22877145, 64823568, 184274931, 525282740, 1501215193, 4299836186, 12340952049, 35486796312, 102220582465, 294917666854, 852123981581, 2465458792768
Offset: 0

Views

Author

N. J. A. Sloane, Sep 01 2019

Keywords

Comments

A "low point" in a sequence is a term which is less than the previous term (this condition is skipped for the initial term) and which is followed by two or more increases.
This concept is useful for the analysis of sequences (such as A005132, A008344, A008348, A022837, A076042, A309222, etc.) which have long runs of terms which alternately rise and fall.

Crossrefs

Programs

  • Maple
    blocks := proc(a,S) local b,c,d,M,L,n;
    # Given a list a, whose leading term has index S, return [b,c,d], where b lists the indices of the low points in a, c lists the values of a at the low points, and d lists the length of runs between the low points.
    b:=[]; c:=[]; d:=[]; L:=1;
    # is a[1] a low point?
       n:=1;
       if( (a[n+1]>a[n]) and (a[n+2]>a[n+1]) ) then
       b:=[op(b),n+S-1]; c:=[op(c),a[n]]; d:=[op(d), n-L]; L:=n; fi;
    for n from 2 to nops(a)-2 do
    # is a[n] a low point?
       if( (a[n-1]>a[n]) and (a[n+1]>a[n]) and (a[n+2]>a[n+1]) ) then
       b:=[op(b),n+S-1]; c:=[op(c),a[n]]; d:=[op(d), n-L]; L:=n; fi; od;
    [b,c,d]; end;
    # Let a := [0, 2, 5, 0, 7, 18, 5, 22, 3, 26, 55, 24, ...]; be a list of the first terms in A008348
    blocks(a,0)[1]; # the present sequence
    blocks(a,0)[2]; # A324782
    blocks(a,0)[3]; # A324783

Formula

a(n) = A135025(n-1)-1.

Extensions

a(17)-a(28) from Giovanni Resta, Oct 02 2019
Modified definition to make offset 0. - N. J. A. Sloane, Oct 02 2019

A323417 When a prime-based mapping reaches 0.

Original entry on oeis.org

3, 2, 1, 6, 3, 2
Offset: 0

Views

Author

Hugo van der Sanden, Aug 30 2019

Keywords

Comments

Writing p_i for the i-th prime, A000040(i); let n_0 = n, and apply the mapping n_i = n_{i-1} + p_i (if p_i > n_{i-1}) else n_{i-1} - p_i. Then a(n) is the least k > 0 for which n_k = 0, or -1 if no such k exists.
In the traversal of n_i for a given n, if it reaches a local minimum after subtracting p_i, it will next reach a local minimum at p_j which will be close to 3p_i.
Conjecture: a(n) > 0 for all n.
For n in { 6 16 20 30 42 50 51 56 70 76 84 85 90 92 }, a(n) is unknown; in each case either a(n) = -1 or a(n) > 2 * 10^12. a(n) is known for all other n <= 100: see the A-file for details.

Crossrefs

A309222 is the trajectory of this mapping with n_0 = 6.
Showing 1-2 of 2 results.