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

A325445 Difference sequence of A325418.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, May 03 2019

Keywords

Comments

See A325417 for a guide to related sequences. Conjecture: all the differences are in {1,2,3,4,6}; 5 does not occur; a count of differences d(n) = a(n)-a(n-1) for n=2..10000 follows: 1082 occurrences of d(n) = 1; 2693 of 2; 744 of 3; 1609 of 4, 0 of 5, and 198 of 6.

Crossrefs

Programs

  • Mathematica
    a = {1}; Do[AppendTo[a, NestWhile[# + 1 &, Last[a] + 1,
    Apply[Or, Map[MemberQ[a, #] &, Select[Flatten[{#/2, (# - 1)/3}],
    IntegerQ]]] &]], {2000}]; a ;       (* A325417 *)
    c = Complement[Range[Last[a]], a] ; (* A325418 *)
    Differences[a]  (* A325444 *)
    Differences[c]  (* A325445 *)
    (* 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)

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.
		

Crossrefs

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

A325444 Difference sequence of A325417.

Original entry on oeis.org

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

Views

Author

Clark Kimberling, May 03 2019

Keywords

Comments

See A325417 for a guide to related sequences. Conjecture: all the differences are in {1,2,3,4}; a count of differences d(n) = a(n)-a(n-1) for n=2..10000 follows: 4755 occurrences of d(n) = 1; 4332 of 2; 744 of 3; and 169 of 4.

Examples

			A325417 is given by A(n) = least number not 2*A(m) or 3*A(m)+1 for any m < n, so that A = (1,3,5,7,8,9,11, ...), with differences (2,2,2,1,1,2,...).
		

Crossrefs

Programs

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