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

A354300 Numbers k such that k! and (k+1)! have the same binary weight (A000120).

Original entry on oeis.org

0, 1, 3, 5, 7, 8, 12, 13, 15, 31, 63, 88, 127, 129, 131, 244, 255, 262, 263, 288, 300, 344, 511, 793, 914, 1012, 1023, 1045, 1116, 1196, 1538, 1549, 1565, 1652, 1817, 1931, 1989, 2047, 2067, 2096, 2459, 2548, 2862, 2918, 2961, 3372, 3478, 3540, 3588, 3673, 3707
Offset: 1

Views

Author

Amiram Eldar, May 23 2022

Keywords

Comments

Numbers k such that A079584(k) = A079584(k+1).
The corresponding values of A079584(k) are 1, 1, 2, 4, 6, 6, 12, 12, 18, 42, ...
This sequence is infinite as it contains A000225. - Rémy Sigrist, May 23 2022

Examples

			1 is a term since A079584(1) = A079584(2) = 1.
3 is a term since A079584(3) = A079584(4) = 2.
		

Crossrefs

A354301 is a subsequence.

Programs

  • Mathematica
    s[n_] := s[n] = DigitCount[n!, 2, 1]; Select[Range[0, 4000], s[#] == s[# + 1] &]
  • PARI
    isok(k) = hammingweight(k!) == hammingweight((k+1)!); \\ Michel Marcus, May 23 2022
  • Python
    from itertools import count, islice
    def wt(n): return bin(n).count("1")
    def agen(): # generator of terms
        n, fn, fnplus, wtn, wtnplus = 0, 1, 1, 1, 1
        for n in count(0):
            if wtn == wtnplus: yield n
            fn, fnplus = fnplus, fnplus*(n+2)
            wtn, wtnplus = wtnplus, wt(fnplus)
    print(list(islice(agen(), len(data)))) # Michael S. Branicky, May 23 2022
    
Showing 1-1 of 1 results.