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-5 of 5 results.

A325519 Difference sequence of A325426.

Original entry on oeis.org

2, 2, 1, 3, 2, 1, 3, 2, 3, 1, 3, 3, 2, 4, 2, 2, 1, 1, 3, 3, 2, 1, 3, 2, 1, 3, 3, 1, 1, 1, 2, 1, 3, 4, 1, 1, 3, 3, 2, 1, 3, 2, 4, 3, 3, 2, 1, 3, 2, 1, 3, 2, 1, 2, 1, 2, 1, 3, 5, 1, 3, 3, 2, 1, 3, 2, 2, 1, 1, 3, 3, 2, 1, 3, 2, 3, 1, 3, 3, 2, 4, 4, 1, 1, 2, 1
Offset: 1

Views

Author

Clark Kimberling, May 06 2019

Keywords

Comments

See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4,5,6,7}.

Links

Crossrefs

Cf. A325417, A325426, A325518.

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]]] &]], {200}]; a ; (* A325425 *)
c = Complement[Range[Last[a]], a] ;    (* A325426 *)
Differences[a]  (* A325518 *)
Differences[c]  (* A325519 *)
(* Peter J. C. Moses, Apr 23 2019 *)

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

Original entry on oeis.org

1, 3, 5, 7, 8, 9, 11, 12, 13, 15, 17, 19, 20, 21, 23, 27, 29, 31, 32, 33, 35, 36, 39, 41, 43, 44, 45, 47, 48, 49, 50, 51, 53, 55, 56, 57, 59, 60, 63, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 79, 80, 81, 83, 84, 85, 87, 89, 91, 92, 93, 95, 99, 101, 103, 104
Offset: 1

Views

Author

Clark Kimberling, Apr 24 2019

Keywords

Comments

In column 1 of the following guide to related sequences, disallowed terms are indicated by the variable x representing a(m) for m < n.
Disallowed Sequence(a) Complement(c) Differences(a) Differences(c)
2x, 3x+1 A325417 A325418 A325444 A325445
3x, 2x+1 A325419 A325420 A325494 A325495
2x+1, 3x+1 A077477 A325422 A325496 A325497
2x, 3x A036668 A325424 A325498 A325499
[3x/2], 2x A325425 A325426 A325518 A325519
[3x/2], 2x+1 A325427 A325428 A325520 A325521
[3x/2], 3x A325429 A325430 A325522 A325523
3x, 4x A325431 A325432 A325525 A325526
2x, 3x-1 A325462 A325463 A325526 A325527
2x, 3x-2 A325464 A325465 A325528 A325529
2x-1, 3x-1 A325440 A325441 A325530 A325531
2x-1, 3x A325442 A325443 A325532 A325533
2x+1, 3x+2 A325539 A325540 A325541 A325542

Examples

			The sequence necessarily starts with 1.  The next 2 terms are determined as follows:  because a(1) = 1, the numbers 2 and 4 are disallowed, so that a(2) = 3, whence the numbers 6 and 10 are disallowed, so that a(3) = 5.

Links

Crossrefs

Cf. A325418, A325444.

Programs

  • Mathematica
    a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{#/2, (# - 1)/3}],
IntegerQ]]] &]], {150}]; a     (* A325417 *)
Complement[Range[Last[a]], a]  (* A325418 *)
(* Peter J. C. Moses, Apr 23 2019 *)

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.

Links

Crossrefs

Cf. A325417, A325426.

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 *)

A325518 Difference sequence of A325425.

Original entry on oeis.org

2, 2, 3, 1, 2, 3, 1, 2, 2, 1, 3, 1, 2, 1, 2, 2, 1, 1, 2, 2, 4, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 1, 5, 3, 1, 2, 1, 1, 4, 1, 2, 1, 2, 3, 1, 2, 2, 1, 1, 2, 1, 2, 1, 2, 3, 1, 2, 3, 1, 2, 3, 3, 3, 1, 2, 1, 1, 1, 3, 1, 2, 1, 2, 3, 1, 2, 2, 4, 1, 2, 1, 2, 3, 1, 2, 2
Offset: 1

Views

Author

Clark Kimberling, May 06 2019

Keywords

Comments

See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4,5,6}.

Links

Crossrefs

Cf. A325417, A325425, A325519.

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]]] &]], {200}]; a ; (* A325425 *)
c = Complement[Range[Last[a]], a] ;    (* A325426 *)
Differences[a]  (* A325518 *)
Differences[c]  (* A325519 *)
(* Peter J. C. Moses, Apr 23 2019 *)

A325526 Difference sequence of A325462.

Original entry on oeis.org

2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 2, 1, 1, 2, 1, 3, 2, 1, 1, 2, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 1, 1, 2, 2, 1, 1, 2, 2, 3, 1, 2, 1, 1, 2, 2, 4, 2, 1, 1, 2, 2, 1, 1, 1, 1, 2, 1, 1, 2, 2
Offset: 1

Views

Author

Clark Kimberling, May 07 2019

Keywords

Comments

See A325417 for a guide to related sequences. Conjecture: every term is in {1,2,3,4}.

Links

Crossrefs

Cf. A325417, A325426, A325527.

Programs

  • Mathematica
    a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1, Apply[Or,
Map[MemberQ[a, #] &, Select[Flatten[{#/2, (#+1)/3}],
IntegerQ]]] &]], {20000}]; a;         (* A315462 *)
c = Complement[Range[Last[a]], a] ;   (* A325463 *)
Differences[a]  (* A325526 *)
Differences[c]  (* A325527 *)
(* Peter J. C. Moses, Apr 23 2019 *)
Showing 1-5 of 5 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.