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

A358618 First differences of A258036.

Original entry on oeis.org

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

Views

Author

Keywords

Comments

Conjecture: All terms belong to {1, 2, 3}. See third comment in A258036.

Crossrefs

Programs

  • Maple
    P:= :
    S:= NULL: count:= 0:
    for i from 2 while count < 101 do
      P:= P[2..-1] - P[1..-2];
      if P[1] < 0 then S:= S,i; count:= count+1; fi;
    od:
    S:= [S]:
    S[2..-1]-S[1..-2]; # Robert Israel, Dec 21 2022
  • Mathematica
    nn = 210; p = Prime@ Range@ nn; t = Table[ Differences[p, n][[1]], {n, 0, nn - 1}]; s = Select[ Range@ nn, t[[#]] < 0 &]; d = Differences@ s

A358273 Number of binary digits of A007442(n).

Original entry on oeis.org

2, 1, 1, 1, 2, 4, 5, 6, 7, 8, 9, 10, 11, 11, 9, 12, 14, 16, 17, 18, 19, 20, 21, 21, 21, 21, 21, 24, 26, 27, 28, 29, 30, 31, 32, 32, 33, 33, 31, 34, 36, 38, 39, 40, 41, 41, 41, 41, 44, 46, 48, 49, 51, 52, 53, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Mathematica
    nn = 80; p = Prime@ Range@ nn; t = Table[ Differences[p, n][[1]], {n, 0, nn - 1}]; lid = Table[ Length@ IntegerDigits[ t[[n]], 2], {n, nn}]
Showing 1-2 of 2 results.