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

A353967 a(n) is the number of ways to write n as a sum of distinct terms of A353966.

Original entry on oeis.org

1, 0, 0, 0, 1, 0, 1, 0, 0, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 1, 1, 0, 2, 1, 0, 2, 1, 0, 1, 3, 0, 2, 1, 1, 0, 4, 0, 2, 0, 2, 1, 4, 0, 1, 2, 2, 1, 3, 1, 0, 3, 2, 1, 1, 3, 0, 3, 1, 2, 1, 3, 0, 4, 1, 1, 2, 4, 0, 2, 3, 1, 2, 4, 1, 1, 4, 2, 2, 2, 2, 1, 5, 1, 1, 3, 3, 0
Offset: 0

Views

Author

Rémy Sigrist, May 14 2022

Keywords

Comments

a(0) = 1 accounts for the empty sum.

Crossrefs

A353968 Numbers that are not the sum of distinct terms of A353966.

Original entry on oeis.org

1, 2, 3, 5, 7, 8, 9, 11, 13, 15, 17, 21, 24, 27, 30, 34, 36, 38, 42, 49, 55, 61, 67, 86, 89, 92, 111, 117, 123, 140, 144, 148, 165, 171, 177, 199, 202, 227, 233, 239, 264, 267, 289, 295, 301, 318, 322, 326, 343, 349, 355, 374, 377, 380, 399, 405, 411, 428, 432
Offset: 1

Views

Author

Rémy Sigrist, May 14 2022

Keywords

Comments

Also positions of 0's in A353967.
This sequence is infinite as it contains the Fibonacci numbers > 0.

Crossrefs

A353889 Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a power of 2.

Original entry on oeis.org

3, 6, 9, 11, 19, 24, 43, 69, 77, 123, 192, 261, 507, 699, 1029, 1536, 2043, 4101, 5637, 8187, 12288, 16389, 32763, 45051, 65541, 98304, 131067, 262149, 360453, 524283, 786432, 1048581, 2097147, 2883579, 4194309, 6291456, 8388603, 16777221, 23068677, 33554427
Offset: 1

Views

Author

Rémy Sigrist, May 09 2022

Keywords

Comments

The sequence is well defined:
- a(1) = 3,
- for n > 0, let k be such that 2^k + 1 + a(1) + ... + a(n) < 2^(k+1),
- then a(n+1) <= 2^k + 1.
The variant where we avoid powers of 3 corresponds to the positive even numbers (A299174).

Examples

			- 1 = 2^0, so 1 is not a term,
- 2 = 2^1, so 2 is not a term,
- a(1) = 3 (as 3 is not a power of 2),
- 4 = 2^2, so 4 is not a term,
- 3 + 5 = 2^3, so 5 is not a term,
- a(2) = 6 (as neither 6 nor 3 + 6 is a power of 2),
- 3 + 6 + 7 = 2^4, so 7 is not a term,
- 8 = 2^3, so 8 is not a term,
- a(3) = 9 (as none of 9, 3 + 9, 6 + 9, 3 + 6 + 9 is a power of 2).
		

Crossrefs

Cf. similar sequences: A052349 (prime numbers), A133662 (square numbers), A353966 (Fibonacci numbers), A353969 (factorial numbers), A353980 (primorial numbers), A353983 (Catalan numbers), A354005 (Pell numbers).

Programs

  • Python
    from math import gcd
    from itertools import count, islice
    def agen(): # generator of terms
        a, ss, pows2, m = [], set(), {1, 2}, 2
        for k in count(1):
            if k in pows2: continue
            elif k > m: m <<= 1; pows2.add(m)
            if any(p2-k in ss for p2 in pows2): continue
            a.append(k); yield k
            ss |= {k} | {k+si for si in ss if k+si not in ss}
            while m < max(ss): m <<= 1; pows2.add(m)
    print(list(islice(agen(), 32))) # Michael S. Branicky, Jun 09 2023

A353980 Lexicographically earliest sequence of distinct positive integers with no finite subset summing to a primorial number (A002110).

Original entry on oeis.org

3, 4, 5, 7, 8, 9, 24, 28, 29, 31, 32, 36, 180, 204, 208, 209, 211, 212, 213, 214, 215, 216, 222, 2100, 2124, 2280, 2304, 2308, 2309, 2311, 2312, 2313, 2314, 2315, 2316, 2514, 27720, 29820, 29844, 30000, 30024, 30028, 30029, 30031, 30032, 30033, 30034, 30035
Offset: 1

Views

Author

Rémy Sigrist, May 13 2022

Keywords

Comments

The sequence is well defined:
- a(1) = 3,
- for n > 0, let k be such that A002110(k) + 1 + a(1) + ... + a(n) < A002110(k+1),
- then a(n+1) <= A002110(k) + 1.

Crossrefs

See A353966 for similar sequences.
Showing 1-4 of 4 results.