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

A050133 a(n)=least k satisfying a(k)=n in A050132.

Original entry on oeis.org

1, 10, 3, 14, 9, 2, 6, 13, 29, 8, 17, 4, 20, 42, 5, 12, 25, 53, 28, 57, 7, 16, 33, 69, 36, 73, 19, 78, 41, 85, 22, 45, 11, 24, 49, 101, 52, 105, 27, 56, 114, 230, 60, 121, 15, 32, 65, 133, 68, 137, 35, 72, 146, 18, 38, 77, 157, 40, 81, 165
Offset: 1

Views

Author

Keywords

A050134 a(n)=least k satisfying a(k)=3*k in A050132.

Original entry on oeis.org

2, 4, 5, 7, 11, 15, 18, 21, 23, 26, 30, 31, 34, 37, 39, 43, 46, 47, 50, 54, 58, 61, 63, 66, 70, 74, 75, 79, 82, 86, 87, 90, 93, 95, 98, 102, 106, 109, 111, 115, 118, 122, 123, 126, 127, 130, 134, 138, 141, 143, 147, 150, 151, 154, 158
Offset: 1

Views

Author

Keywords

A050128 a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 2*n.

Original entry on oeis.org

1, 4, 2, 8, 10, 5, 14, 7, 3, 20, 22, 11, 26, 13, 6, 32, 16, 36, 18, 9, 42, 21, 46, 23, 50, 25, 12, 56, 28, 60, 30, 15, 66, 33, 70, 35, 17, 76, 38, 19, 82, 41, 86, 43, 90, 45, 94, 47, 98, 49, 24, 104, 52, 108, 54, 27, 114, 57, 118, 59, 29, 124
Offset: 1

Views

Author

Keywords

Comments

Does this sequence contain every positive integer exactly once?

Crossrefs

Programs

  • Maple
    N:= 100: # for a(1)..a(N)
    V:= Vector(N): S:= {0,1}:
    V[1]:= 1:
    for n from 2 to N do
      v:= floor(V[n-1]/2);
      if member(v, S) then V[n]:= 2*n
      else V[n]:= v
      fi;
      S:= S union {V[n]}
    od:
    convert(V,list); # Robert Israel, Feb 09 2020
  • Mathematica
    f[s_List] := Block[{len = Length@s, m = Floor[s[[-1]]/2]}, Append[s, If[MemberQ[s, m], 2 len, m]]]; Rest@Nest[f, {0, 1}, 65] (* Robert G. Wilson v, Aug 09 2018 *)

A050136 a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1), otherwise a(n)=5*n.

Original entry on oeis.org

1, 10, 5, 2, 25, 12, 6, 3, 45, 22, 11, 60, 30, 15, 7, 80, 40, 20, 95, 47, 23, 110, 55, 27, 13, 130, 65, 32, 16, 8, 4, 160, 165, 82, 41, 180, 90, 190, 195, 97, 48, 24, 215, 107, 53, 26, 235, 117, 58, 29, 14, 260, 265, 132, 66, 33, 285, 142, 71, 35, 17, 310, 155, 77, 38, 19, 9, 340, 170, 85, 42, 21
Offset: 1

Views

Author

Keywords

Comments

Does this sequence contain every positive integer exactly once?

Crossrefs

Programs

  • Maple
    S:= {0,1}: A[1]:= 1:
    for n from 2 to 100 do
      v:= floor(A[n-1]/2);
      if not member(v,S) then A[n]:= v
      else A[n]:= 5*n
      fi;
      S:= S union {A[n]};
    od:
    seq(A[i],i=1..100); # Robert Israel, Aug 07 2018
  • Mathematica
    f[s_List] := Block[{len = Length@s, m = Floor[s[[-1]]/2]}, Append[s, If[MemberQ[s, m], 5 len, m]]]; Rest@ Nest[f, {0, 1}, 65] (* Robert G. Wilson v, Aug 07 2018 *)

Extensions

Corrected by Robert Israel, Aug 07 2018

A050416 a(1)=a(2)=1, then a(n+1) = floor(a(n)/3) if this is not among 0, a(1), ..., a(n); otherwise a(n+1) = a(n) + a(n-1).

Original entry on oeis.org

1, 1, 2, 3, 5, 8, 13, 4, 17, 21, 7, 28, 9, 37, 12, 49, 16, 65, 81, 27, 108, 36, 144, 48, 192, 64, 256, 85, 341, 113, 454, 151, 50, 201, 67, 22, 89, 29, 118, 39, 157, 52, 209, 69, 23, 92, 30, 10, 40, 50, 90, 140, 46, 15, 61, 20, 6, 26, 32
Offset: 1

Views

Author

Keywords

Comments

Numbers appearing among the terms more than once include 1, 50, 265, 341, 516, 570, 622, ... - Ivan Neretin, Sep 04 2015

Crossrefs

Programs

  • Mathematica
    a = {0, 1, 1}; Do[AppendTo[a, If[MemberQ[a, c = Quotient[a[[-1]], 3]], a[[-1]] + a[[-2]], c]], {n, 3, 59}]; Delete[a, 1] (* Ivan Neretin, Sep 04 2015 *)

A050137 a(1)=2; a(n) = floor(a(n-1)/2) if this is not among 0,a(1),...,a(n-1); otherwise a(n) = 2*n.

Original entry on oeis.org

2, 1, 6, 3, 10, 5, 14, 7, 18, 9, 4, 24, 12, 28, 30, 15, 34, 17, 8, 40, 20, 44, 22, 11, 50, 25, 54, 27, 13, 60, 62, 31, 66, 33, 16, 72, 36, 76, 38, 19, 82, 41, 86, 43, 21, 92, 46, 23, 98, 49, 102, 51, 106, 53, 26, 112, 56, 116, 58, 29, 122, 61
Offset: 1

Views

Author

Keywords

Comments

Does this sequence contain every positive integer exactly once?

Crossrefs

Programs

  • Maple
    R:= 2: S:= {2}: a:= 2:
    for n from 2 to 100 do
      t:= floor(a/2);
      if t <> 0 and not member(t,S) then a:= t else a:= 2*n fi;
      R:= R,a; S:= S union {a};
    od:
    R; # Robert Israel, Aug 03 2025

A050139 a(1)=2; for n > 1, a(n) = floor(a(n-1)/2) if this is not among 0, a(1), ..., a(n-1); otherwise a(n) = 4*n.

Original entry on oeis.org

2, 1, 12, 6, 3, 24, 28, 14, 7, 40, 20, 10, 5, 56, 60, 30, 15, 72, 36, 18, 9, 4, 92, 46, 23, 11, 108, 54, 27, 13, 124, 62, 31, 136, 68, 34, 17, 8, 156, 78, 39, 19, 172, 86, 43, 21, 188, 94, 47, 200, 100, 50, 25, 216, 220, 110, 55, 232, 116
Offset: 1

Views

Author

Keywords

Comments

Does this sequence contain every positive integer exactly once?

Crossrefs

Programs

  • Mathematica
    Delete[#, 3] &@ Nest[Append[#1, If[FreeQ[#1, #2], #2, 4 #3]] & @@ {#, Floor[#[[-1]]/2], Length@ #} &, {2}, 59] (* Michael De Vlieger, Oct 06 2019 *)
Showing 1-7 of 7 results.