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.

A325425 a(n) is the least number not 2*a(m) or floor(3*a(m)/2) for any m < n.

Original entry on oeis.org

1, 3, 5, 8, 9, 11, 14, 15, 17, 19, 20, 23, 24, 26, 27, 29, 31, 32, 33, 35, 37, 41, 42, 44, 45, 47, 50, 51, 53, 56, 57, 59, 60, 65, 68, 69, 71, 72, 73, 77, 78, 80, 81, 83, 86, 87, 89, 91, 92, 93, 95, 96, 98, 99, 101, 104, 105, 107, 110, 111, 113, 116, 119
Offset: 1

Views

Author

Clark Kimberling, Apr 27 2019

Keywords

Comments

The sequence necessarily starts with 1. The next 2 terms are determined as follows: because a(1) = 1, the number 2 is disallowed, so that a(2) = 3, whence the numbers 4 and 6 are disallowed, and a(3) = 5. See A325417 for a guide to related sequences.

Crossrefs

Programs

  • Mathematica
    a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,
    Map[MemberQ[a, #] &, Select[Flatten[{#/2,
    If[Mod[#, 3] == 0, (2 #)/3, 0] + If[Mod[#, 3] == 1, 1/3 (1 + 2 #), 0]}],
    IntegerQ || # == 0]]] &]], {150}]; a (* A325425 *)
    Complement[Range[Last[a]], a];       (* A325426 *)
    (* Peter J. C. Moses, Apr 25 2019 *)