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.

A337289 Numbers k such that k+1 is in A095096 and k is in A020899.

Original entry on oeis.org

3, 5, 8, 13, 17, 21, 25, 28, 32, 34, 38, 41, 45, 50, 52, 55, 59, 62, 66, 71, 73, 79, 81, 84, 89, 93, 96, 100, 105, 107, 113, 115, 118, 122, 126, 128, 131, 136, 140, 144, 148, 151, 155, 160, 162, 168, 170, 173, 177, 181, 183, 186, 191, 195, 198, 202, 204, 207, 212, 216, 220, 224, 227
Offset: 1

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    SequencePosition[Mod[DigitCount[Select[Range[0, 3000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {1, 0}][[;; , 1]] - 1 (* Amiram Eldar, Feb 05 2023 *)

A337290 Numbers k such that both k and k+1 are in A020899.

Original entry on oeis.org

1, 2, 12, 19, 20, 27, 30, 31, 40, 43, 44, 48, 49, 61, 64, 65, 69, 70, 77, 78, 88, 95, 98, 99, 103, 104, 111, 112, 124, 125, 135, 142, 143, 150, 153, 154, 158, 159, 166, 167, 179, 180, 190, 197, 200, 201, 211, 218, 219, 226, 229, 230, 239, 242, 243, 247, 248, 255, 256, 268, 269, 279
Offset: 1

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    SequencePosition[Mod[DigitCount[Select[Range[0, 3000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {1, 1}][[;; , 1]] - 1 (* Amiram Eldar, Feb 05 2023 *)

A337634 Number of numbers k <= n such that both k and k+1 are in A095096.

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 1, 1, 1, 2, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 10, 10, 10, 10, 10, 10, 10, 11, 11, 11, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 14, 14, 14, 14, 15, 16, 16, 16, 16, 16, 16, 16, 17
Offset: 0

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    s = SequencePosition[Mod[DigitCount[Select[Range[0, 400], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {0, 0}][[;; , 1]] - 1; t = Table[0, {s[[-1]] + 1}]; t[[s + 1]] = 1; Accumulate[t] (* Amiram Eldar, Feb 05 2023 *)

Extensions

Offset corrected by Amiram Eldar, Feb 05 2023

A337635 Number of numbers k <= n such that k is in A095096 and k+1 is in A020899.

Original entry on oeis.org

1, 1, 1, 1, 2, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 4, 5, 5, 6, 6, 6, 6, 6, 6, 7, 7, 8, 8, 8, 9, 9, 9, 9, 10, 10, 10, 10, 11, 11, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 14, 14, 15, 15, 15, 16, 16, 16, 16, 17, 17, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 20, 20, 21, 21, 21, 21, 22, 22, 22, 22
Offset: 0

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    s = SequencePosition[Mod[DigitCount[Select[Range[0, 400], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {0, 1}][[;; , 1]] - 1; t = Table[0, {s[[-1]] + 1}]; t[[s + 1]] = 1; Accumulate[t] (* Amiram Eldar, Feb 05 2023 *)

Extensions

Offset corrected by Amiram Eldar, Feb 05 2023

A337636 Number of numbers k <= n such that k+1 is in A095096 and k is in A020899.

Original entry on oeis.org

0, 0, 0, 1, 1, 2, 2, 2, 3, 3, 3, 3, 3, 4, 4, 4, 4, 5, 5, 5, 5, 6, 6, 6, 6, 7, 7, 7, 8, 8, 8, 8, 9, 9, 10, 10, 10, 10, 11, 11, 11, 12, 12, 12, 12, 13, 13, 13, 13, 13, 14, 14, 15, 15, 15, 16, 16, 16, 16, 17, 17, 17, 18, 18, 18, 18, 19, 19, 19, 19, 19, 20, 20, 21, 21, 21, 21, 21, 21
Offset: 0

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    s = SequencePosition[Mod[DigitCount[Select[Range[0, 400], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {1, 0}][[;; , 1]] - 1; t = Table[0, {s[[-1]] + 1}]; t[[s + 1]] = 1; Accumulate[t] (* Amiram Eldar, Feb 05 2023 *)

Extensions

Offset corrected by Amiram Eldar, Feb 05 2023

A337637 Number of numbers k <= n such that both k and k+1 are in A020899.

Original entry on oeis.org

0, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 9, 9, 9, 10, 11, 11, 11, 11, 12, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 14, 14, 14, 15, 16, 16, 16, 16, 17, 18, 18, 18, 18, 18, 18, 18, 19, 20, 20, 20
Offset: 0

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    s = SequencePosition[Mod[DigitCount[Select[Range[0, 400], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {1, 1}][[;; , 1]] - 1; t = Table[0, {s[[-1]] + 1}]; t[[s + 1]] = 1; Accumulate[t] (* Amiram Eldar, Feb 05 2023 *)

Extensions

Offset corrected by Amiram Eldar, Feb 05 2023

A337288 Numbers k such that k is in A095096 and k+1 is in A020899.

Original entry on oeis.org

0, 4, 7, 11, 16, 18, 24, 26, 29, 33, 37, 39, 42, 47, 51, 54, 58, 60, 63, 68, 72, 76, 80, 83, 87, 92, 94, 97, 102, 106, 110, 114, 117, 121, 123, 127, 130, 134, 139, 141, 147, 149, 152, 157, 161, 165, 169, 172, 176, 178, 182, 185, 189, 194, 196, 199, 203, 206, 210, 215, 217, 223, 225
Offset: 1

Views

Author

N. J. A. Sloane, Sep 12 2020

Keywords

References

  • Anton Shutov, On the sum of digits of the Zeckendorf representations of two consecutive numbers, Fib. Q., 58:3 (2020), 203-207.

Crossrefs

Programs

  • Mathematica
    SequencePosition[Mod[DigitCount[Select[Range[0, 3000], BitAnd[#, 2 #] == 0 &], 2, 1], 2], {0, 1}][[;; , 1]] - 1 (* Amiram Eldar, Feb 05 2023 *)
Showing 1-7 of 7 results.