A325462 - OEIS

The OEIS is supported by the many generous donors to the OEIS Foundation.

Year-end appeal: Please make a donation to the OEIS Foundation to support ongoing development and maintenance of the OEIS. We are now in our 61st year, we have over 378,000 sequences, and we’ve reached 11,000 citations (which often say “discovered thanks to the OEIS”).

Other ways to Give

A325462

a(n) is the least number not 2*a(m) or 3*a(m)-1 for any m < n.

1, 3, 4, 5, 7, 9, 12, 13, 15, 16, 17, 19, 21, 22, 23, 25, 27, 28, 29, 31, 33, 36, 37, 39, 40, 41, 43, 45, 48, 49, 51, 52, 53, 55, 57, 59, 60, 61, 63, 64, 67, 69, 70, 71, 73, 75, 76, 77, 79, 81, 84, 85, 87, 88, 89, 91, 93, 94, 95, 97, 99, 100, 101, 103, 105

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,2

LINKS

Clark Kimberling, Table of n, a(n) for n = 1..10000

EXAMPLE

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 6 and 8 are disallowed, and a(3) = 4. See A325417 for a guide to related sequences.

MATHEMATICA

a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,

Map[MemberQ[a, #] &, Select[Flatten[{#/2, (#+1)/3}],

IntegerQ]]] &]], {150}]; a (* A325462 *)

Complement[Range[Last[a]], a] (* A325463 *)

(* Peter J. C. Moses, Apr 25 2019 *)

CROSSREFS

Cf. A325417, A325463.

Sequence in context: A033556 A219044 A032507 * A063950 A010420 A035260

Adjacent sequences: A325459 A325460 A325461 * A325463 A325464 A325465

KEYWORD

nonn,easy

AUTHOR

Clark Kimberling, May 01 2019

STATUS

approved