The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A368491 a(n) is the integer whose bits designate the possible subset sums of the first n prime numbers. 0
 1, 5, 45, 1453, 186285, 381681581, 3126736191405, 409827566090715053, 214867674970568857223085, 1802440697199513680253124870061, 967677980931418755473971539884090851245, 2078072640579877586820864371518464918573279084461, 285608128960093974754528418755948821932657172723113570336685 (list; graph; refs; listen; history; text; internal format)
 OFFSET 0,2 COMMENTS Bit position 0 (which is sum 0) is the least significant bit of a(n). The resulting binary string is palindromic for all n. A subset sum of zero marks one end of the binary string, while the sum of all n primes marks the other end. Therefore, starting from no primes and adding some and starting from all primes and omitting some correspond to the same pattern. (This is so for any values, not just primes.) It is observed that for an array of primes, for large values of n, the binary string starts with a certain pattern and ends with the reverse of this certain pattern and consists of all ones in the middle area. LINKS Table of n, a(n) for n=0..12. FORMULA a(n) = a(n-1) BITOR a(n-1)*2^prime(n). a(n) = 91*2^(A007504(n)-6) - 83 for n > 3. EXAMPLE For n = 0, there are no terms from which to calculate a subset sum. An empty array gives zero as the only possible sum. This is designated by the binary string 1 which has a value of 1 in base 10. For n = 2, sums of 0,2,3,5 are possible, yielding a binary string of 101101, which has a value of 45 in base 10. The impossibility of sums 1 and 4 is indicated by 0's in the binary string. For n = 3, the primes are 2,3,5 and their subset sums 0, 2, 3, 5, 7, 8, 10 are the positions of 1 bits in a(3) = 1453, 10 8 7 5 3 2 0 bit positions a(n) = 1 0 1 1 0 1 0 1 1 0 1 binary PROG (Python) from primesieve import * n = 20 ps = generate_n_primes(n) res = 1 a = [] a.append(res) for v in ps: res = (res | (res << v)) a.append(res) print(a) CROSSREFS Cf. A000040, A082548 (number of sums), A007504 (see formula). Sequence in context: A191962 A326650 A323572 * A318092 A050641 A112396 Adjacent sequences: A368488 A368489 A368490 * A368492 A368493 A368494 KEYWORD base,nonn AUTHOR Yigit Oktar, Dec 27 2023 STATUS approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified May 21 17:21 EDT 2024. Contains 372738 sequences. (Running on oeis4.)