A036554 -id:A036554 - cp's OEIS frontend

A161673 Positions n such that A010060(n) + A010060(n+8) = 1.

0, 1, 2, 3, 4, 5, 6, 7, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 48, 49, 50, 51, 52, 53, 54, 55, 64, 65, 66, 67, 68, 69, 70, 71, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103

Offset: 1

Vladimir Shevelev, Jun 16 2009

nonn

Also union of numbers of the form 8*A121539(n)+k, 0<=k<8.

Generalization: the numbers n such that A010060(n)+A010060(n+2^m)=1 constitute the union of sequences {2^m*A121539(n)+k}, k=0,1,...,2^m-1.

G. C. Greubel, Table of n, a(n) for n = 1..10000

Cf. A161639, A161641, A161627, A161579, A161580, A121539, A079523, A131323, A036554, A010060, A121539, A079523, A081706.

tm[0] = 0; tm[n_?EvenQ] := tm[n] = tm[n/2]; tm[n_] := tm[n] = 1 - tm[(n - 1)/2]; Reap[For[n = 0, n <= 6000, n++, If[tm[n] + tm[n + 8] == 1, Sow[n]]]][[2, 1]] (* G. C. Greubel, Jan 05 2018 *)

is(n)=hammingweight(n)%2!=hammingweight(n+8)%2 \\ Charles R Greathouse IV, Aug 20 2013

A001477 \ A161639.

Edited and extended by R. J. Mathar, Sep 02 2009

A332821 One part of a 3-way classification of the positive integers. Numbers n for which A048675(n) == 1 (mod 3).

Original entry on oeis.org

2, 5, 9, 11, 12, 16, 17, 21, 23, 28, 30, 31, 39, 40, 41, 47, 49, 52, 54, 57, 59, 66, 67, 70, 72, 73, 75, 76, 83, 87, 88, 91, 96, 97, 100, 102, 103, 109, 111, 116, 126, 127, 128, 129, 130, 133, 135, 136, 137, 138, 148, 149, 154, 157, 159, 165, 167, 168, 169, 172, 175, 179, 180, 183, 184, 186, 190, 191, 197, 203, 211, 212

Offset: 1

Antti Karttunen and Peter Munn, Feb 25 2020

nonn

The positive integers are partitioned between A332820, this sequence and A332822.
For each prime p, the terms include exactly one of p and p^2. The primes alternate between this sequence and A332822. This sequence has the primes with odd indexes, those in A031368.
The terms are the even numbers in A332822 halved. The terms are also the numbers m such that 5m is in A332822, and so on for alternate primes: 11, 17, 23 etc. Likewise, the terms are the numbers m such that 3m is in A332820, and so on for alternate primes: 7, 13, 19 etc.
The numbers that are half of the even terms of this sequence are in A332820, which consists exactly of those numbers. The numbers that are one third of the terms that are multiples of 3 are in A332822, which consists exactly of those numbers. For larger primes, an alternating pattern applies as described in the previous paragraph.
If we take each odd term of this sequence and replace each prime in its factorization by the next smaller prime, the resulting number is in A332822, which consists entirely of those numbers.
The product of any 2 terms of this sequence is in A332822, the product of any 3 terms is in A332820, and the product of a term of A332820 and a term of this sequence is in this sequence. So if a number k is present, k^2 is in A332822, k^3 is in A332820, and k^4 is in this sequence.
If k is an even number, exactly one of {k/2, k, 2k} is in the sequence (cf. A191257 / A067368 / A213258); and generally if k is a multiple of a prime p, exactly one of {k/p, k, k*p} is in the sequence.

Positions of ones in A332823; equivalently, numbers in row 3k+1 of A277905 for some k >= 0.
Cf. A048675, A332820, A332822.
Comparable 2 or 3-way classifications: A000379/A000028, A001969/A000069, A003159/A036554, A005843/A005408, A028260/A026424, A191257/A067368/A213258, A325431/A325432, A329609/A329604/A332812.
Subsequences: intersection of A026478 and A066208, A031368 (prime terms), A033431\{0}, A052934\{1}, A069486, A099800, A167747\{1}, A244725\{0}, A244728\{0}, A338911 (semiprime terms).

Select[Range@ 212, Mod[Total@ #, 3] == 1 &@ Map[#[[-1]]*2^(PrimePi@ #[[1]] - 1) &, FactorInteger[#]] &] (* Michael De Vlieger, Mar 15 2020 *)

isA332821(n) =  { my(f = factor(n)); (1==((sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3)); };

{a(n) : n >= 1} = {2 * A332820(k) : k >= 1} U {A003961(A332822(k)) : k >= 1}.

{a(n) : n >= 1} = {A332822(k)^2 : k >= 1} U {A331590(2, A332820(k)) : k >= 1}.

A332822 One part of a 3-way classification of the positive integers. Numbers n for which A048675(n) == 2 (mod 3).

Original entry on oeis.org

3, 4, 7, 10, 13, 18, 19, 22, 24, 25, 29, 32, 34, 37, 42, 43, 45, 46, 53, 55, 56, 60, 61, 62, 71, 78, 79, 80, 81, 82, 85, 89, 94, 98, 99, 101, 104, 105, 107, 108, 113, 114, 115, 118, 121, 131, 132, 134, 139, 140, 144, 146, 150, 151, 152, 153, 155, 163, 166, 173, 174, 176, 181, 182, 187, 189, 192, 193, 194, 195, 199, 200, 204

Offset: 1

Antti Karttunen and Peter Munn, Feb 25 2020

nonn

The positive integers are partitioned between A332820, A332821 and this sequence.
For each prime p, the terms include exactly one of p and p^2. The primes alternate between this sequence and A332821. This sequence has the primes with even indexes, those in A031215.
The terms are the even numbers in A332820 halved. The terms are also the numbers m such that 5m is in A332820, and so on for alternate primes: 11, 17, 23 etc. Likewise, the terms are the numbers m such that 3m is in A332821, and so on for alternate primes: 7, 13, 19, 29 etc.
If we take each odd term of this sequence and replace each prime in its factorization by the next smaller prime, we get the same set of numbers as we get from halving the even terms of this sequence, and A332821 consists exactly of those numbers. The numbers that are one third of the terms that are multiples of 3 are in A332820, which consists exactly of those numbers. The numbers that are one fifth of the terms that are multiples of 5 constitute A332821, and for larger primes, an alternating pattern applies as described in the previous paragraph.
The product of any 2 terms of this sequence is in A332821, the product of any 3 terms is in A332820, and the product of a term of A332820 and a term of this sequence is in this sequence. So if a number k is present, k^2 is in A332821, k^3 is in A332820, and k^4 is in this sequence.
If k is an even number, exactly one of {k/2, k, 2k} is in the sequence (cf. A191257 / A067368 / A213258); and generally if k is a multiple of a prime p, exactly one of {k/p, k, k*p} is in the sequence.

Positions of terms valued -1 in A332823; equivalently, numbers in row 3k-1 of A277905 for some k >= 1.
Cf. A048675, A332820, A332821.
Comparable 2 or 3-way classifications: A000379/A000028, A001969/A000069, A003159/A036554, A005843/A005408, A028260/A026424, A191257/A067368/A213258, A325431/A325432, A329609/A329604/A332812.
Subsequences: intersection of A026478 and A066207, A031215 (prime terms), A033430\{0}, A117642\{0}, A169604, A244727\{0}, A244729\{0}, A338910 (semiprime terms).

Select[Range@ 204, Mod[Total@ #, 3] == 2 &@ Map[#[[-1]]*2^(PrimePi@ #[[1]] - 1) &, FactorInteger[#]] &] (* Michael De Vlieger, Mar 15 2020 *)

isA332822(n) =  { my(f = factor(n)); (2==((sum(k=1, #f~, f[k, 2]*2^primepi(f[k, 1]))/2)%3)); };

{a(n) : n >= 1} = {2 * A332821(k) : k >= 1} U {A003961(A332821(k)) : k >= 1}.

{a(n) : n >= 1} = {A332821(k)^2 : k >= 1} U {A331590(2, A332821(k)) : k >= 1}.

A372586 Numbers k such that (sum of binary indices of k) + (sum of prime indices of k) is odd.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 9, 12, 15, 16, 17, 20, 21, 29, 32, 36, 42, 43, 45, 46, 47, 48, 51, 53, 54, 55, 59, 60, 61, 63, 64, 65, 66, 67, 68, 71, 73, 78, 79, 80, 81, 84, 89, 91, 93, 94, 95, 97, 99, 101, 105, 110, 111, 113, 114, 115, 116, 118, 119, 121, 122, 125, 127

Offset: 1

Gus Wiseman, May 14 2024

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
The even version is A372587.

			The terms (center), their binary indices (left), and their weakly decreasing prime indices (right) begin:
            {1}   1  ()
            {2}   2  (1)
          {1,2}   3  (2)
            {3}   4  (1,1)
          {1,3}   5  (3)
            {4}   8  (1,1,1)
          {1,4}   9  (2,2)
          {3,4}  12  (2,1,1)
      {1,2,3,4}  15  (3,2)
            {5}  16  (1,1,1,1)
          {1,5}  17  (7)
          {3,5}  20  (3,1,1)
        {1,3,5}  21  (4,2)
      {1,3,4,5}  29  (10)
            {6}  32  (1,1,1,1,1)
          {3,6}  36  (2,2,1,1)
        {2,4,6}  42  (4,2,1)
      {1,2,4,6}  43  (14)
      {1,3,4,6}  45  (3,2,2)
      {2,3,4,6}  46  (9,1)
    {1,2,3,4,6}  47  (15)
          {5,6}  48  (2,1,1,1,1)

Positions of odd terms in A372428, zeros A372427.
For minimum (A372437) we have A372439, complement A372440.
For length (A372441, zeros A071814) we have A372590, complement A372591.
For maximum (A372442, zeros A372436) we have A372588, complement A372589.
The complement is A372587.
For just binary indices:
- length: A000069, complement A001969
- sum: A158705, complement A158704
- minimum: A003159, complement A036554
- maximum: A053738, complement A053754
For just prime indices:
- length: A026424 (count A027193), complement A028260 (count A027187)
- sum: A300063 (count A058695), complement A300061 (count A058696)
- minimum: A340932 (count A026804), complement A340933 (count A026805)
- maximum: A244991 (count A027193), complement A244990 (count A027187)
A005408 lists odd numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A029837 gives greatest binary index, least A001511.
A031368 lists odd-indexed primes, even A031215.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A061395 gives greatest prime index, least A055396.
A070939 gives length of binary expansion.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Cf. A000720, A066208, A160786, A257991, A300272, A304818, A340604, A341446, A372429-A372433, A372438.

prix[n_]:=If[n==1,{},Flatten[Cases[FactorInteger[n],{p_,k_}:>Table[PrimePi[p],{k}]]]];
bix[n_]:=Join@@Position[Reverse[IntegerDigits[n,2]],1];
Select[Range[100],OddQ[Total[bix[#]]+Total[prix[#]]]&]

Numbers k such that A029931(k) + A056239(k) is odd.

A372589 Numbers k > 1 such that (greatest binary index of k) + (greatest prime index of k) is even.

Original entry on oeis.org

3, 4, 5, 9, 12, 13, 14, 16, 17, 20, 22, 23, 25, 30, 31, 35, 36, 37, 38, 39, 42, 43, 48, 49, 52, 53, 54, 56, 57, 58, 61, 63, 64, 66, 67, 68, 69, 73, 75, 77, 80, 82, 83, 85, 88, 90, 92, 93, 94, 97, 99, 100, 102, 103, 109, 110, 115, 118, 119, 120, 121, 123, 124

Offset: 1

Gus Wiseman, May 14 2024

nonn

A binary index of n is any position of a 1 in its reversed binary expansion. The binary indices of n are row n of A048793.
A prime index of n is a number m such that prime(m) divides n. The multiset of prime indices of n is row n of A112798.
The odd version is A372588.

			The terms (center), their binary indices (left), and their weakly decreasing prime indices (right) begin:
        {1,2}   3  (2)
          {3}   4  (1,1)
        {1,3}   5  (3)
        {1,4}   9  (2,2)
        {3,4}  12  (2,1,1)
      {1,3,4}  13  (6)
      {2,3,4}  14  (4,1)
          {5}  16  (1,1,1,1)
        {1,5}  17  (7)
        {3,5}  20  (3,1,1)
      {2,3,5}  22  (5,1)
    {1,2,3,5}  23  (9)
      {1,4,5}  25  (3,3)
    {2,3,4,5}  30  (3,2,1)
  {1,2,3,4,5}  31  (11)
      {1,2,6}  35  (4,3)
        {3,6}  36  (2,2,1,1)
      {1,3,6}  37  (12)
      {2,3,6}  38  (8,1)
    {1,2,3,6}  39  (6,2)
      {2,4,6}  42  (4,2,1)
    {1,2,4,6}  43  (14)

For sum (A372428, zeros A372427) we have A372587, complement A372586.
For minimum (A372437) we have A372440, complement A372439.
For length (A372441, zeros A071814) we have A372591, complement A372590.
Positions of even terms in A372442, zeros A372436.
The complement is A372588.
For just binary indices:
- length: A001969, complement A000069
- sum: A158704, complement A158705
- minimum:  A036554, complement A003159
- maximum: A053754, complement A053738
For just prime indices:
- length: A026424 A028260 (count A027187), complement (count A027193)
- sum: A300061 (count A058696), complement A300063 (count A058695)
- minimum: A340933 (count A026805), complement A340932 (count A026804)
- maximum: A244990 (count A027187), complement A244991 (count A027193)
A019565 gives Heinz number of binary indices, adjoint A048675.
A029837 gives greatest binary index, least A001511.
A031215 lists even-indexed primes, odd A031368.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A061395 gives greatest prime index, least A055396.
A070939 gives length of binary expansion.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Cf. A000720, A006141, A066207, A243055, A257991, A300272, A304818, A340604, A341446, A372429-A372433, A372438.

Select[Range[2,100],EvenQ[IntegerLength[#,2]+PrimePi[FactorInteger[#][[-1,1]]]]&]

Numbers k such that A070939(k) + A061395(k) is even.

A372590 Numbers whose binary weight (A000120) plus bigomega (A001222) is odd.

Original entry on oeis.org

1, 3, 4, 5, 12, 14, 16, 17, 18, 20, 21, 22, 23, 25, 26, 27, 29, 30, 35, 38, 43, 45, 48, 49, 53, 55, 56, 62, 63, 64, 66, 68, 69, 71, 72, 74, 75, 78, 80, 81, 82, 83, 84, 87, 88, 89, 91, 92, 93, 94, 99, 100, 101, 102, 104, 105, 108, 113, 114, 115, 116, 118, 120

Offset: 1

Gus Wiseman, May 14 2024

nonn

The even version is A372591.

			The terms (center), their binary indices (left), and their weakly decreasing prime indices (right) begin:
        {1}   1  ()
      {1,2}   3  (2)
        {3}   4  (1,1)
      {1,3}   5  (3)
      {3,4}  12  (2,1,1)
    {2,3,4}  14  (4,1)
        {5}  16  (1,1,1,1)
      {1,5}  17  (7)
      {2,5}  18  (2,2,1)
      {3,5}  20  (3,1,1)
    {1,3,5}  21  (4,2)
    {2,3,5}  22  (5,1)
  {1,2,3,5}  23  (9)
    {1,4,5}  25  (3,3)
    {2,4,5}  26  (6,1)
  {1,2,4,5}  27  (2,2,2)
  {1,3,4,5}  29  (10)
  {2,3,4,5}  30  (3,2,1)
    {1,2,6}  35  (4,3)
    {2,3,6}  38  (8,1)
  {1,2,4,6}  43  (14)
  {1,3,4,6}  45  (3,2,2)

For sum (A372428, zeros A372427) we have A372586, complement A372587.
For minimum (A372437) we have A372439, complement A372440.
Positions of odd terms in A372441, zeros A071814.
For maximum (A372442, zeros A372436) we have A372588, complement A372589.
The complement is A372591.
For just binary indices:
- length: A000069, complement A001969
- sum: A158705, complement A158704
- minimum: A003159, complement A036554
- maximum: A053738, complement A053754
For just prime indices:
- length: A026424 (count A027193), complement A028260 (count A027187)
- sum: A300063 (count A058695), complement A300061 (count A058696)
- minimum: A340932 (count A026804), complement A340933 (count A026805)
- maximum: A244991 (count A027193), complement A244990 (count A027187)
A005408 lists odd numbers.
A019565 gives Heinz number of binary indices, adjoint A048675.
A029837 gives greatest binary index, least A001511.
A031368 lists odd-indexed primes, even A031215.
A048793 lists binary indices, length A000120, reverse A272020, sum A029931.
A070939 gives length of binary expansion.
A112798 lists prime indices, length A001222, reverse A296150, sum A056239.
Cf. A000720, A066208, A160786, A257991, A300272, A304818, A340604, A341446, A372429-A372433, A372438.

Select[Range[100],OddQ[DigitCount[#,2,1]+PrimeOmega[#]]&]

A036552 List of pairs (m,2m) where m is the least unused positive number.

Original entry on oeis.org

1, 2, 3, 6, 4, 8, 5, 10, 7, 14, 9, 18, 11, 22, 12, 24, 13, 26, 15, 30, 16, 32, 17, 34, 19, 38, 20, 40, 21, 42, 23, 46, 25, 50, 27, 54, 28, 56, 29, 58, 31, 62, 33, 66, 35, 70, 36, 72, 37, 74, 39, 78, 41, 82, 43, 86, 44, 88, 45, 90, 47, 94, 48, 96, 49, 98, 51, 102

Offset: 1

Tom Verhoeff

A permutation of the natural numbers. Inverse permutation is A065037.

Reinhard Zumkeller, Table of n, a(n) for n = 1..10000
P. Erdős, R. Freud, and N. Hegyvári, Arithmetical properties of permutations of integers, Acta Mathematica Hungarica 41:1-2 (1983), pp. 169-176.
Dana G. Korssjoen, Biyao Li, Stefan Steinerberger, Raghavendra Tripathi, and Ruimin Zhang, Finding structure in sequences of real numbers via graph theory: a problem list, arXiv:2012.04625[math.CO], 2020-2021.
Index entries for sequences that are permutations of the natural numbers

Alternating merge of A003159 and A036554. Cf. A064736, A065037.

import Data.List (delete)
a036552 n = a036552_list !! (n-1)
a036552_list = g [1..] where
   g (x:xs) = x : (2*x) : (g $ delete (2*x) xs)
-- Reinhard Zumkeller, Feb 07 2011

w = {}; Do[ w = If[ FreeQ[w, k], w = Join[w, {k, 2k}], w], {k, 100}]; w
(* Jean-François Alcover, Nov 04 2011, after Wouter Meeussen *)

apairs(N) = my(m=0, r=List(), i=0); while(#rRuud H.G. van Tol, May 09 2024

A091785 Evil numbers (see A001969) in A003159.

Original entry on oeis.org

3, 5, 9, 12, 15, 17, 20, 23, 27, 29, 33, 36, 39, 43, 45, 48, 51, 53, 57, 60, 63, 65, 68, 71, 75, 77, 80, 83, 85, 89, 92, 95, 99, 101, 105, 108, 111, 113, 116, 119, 123, 125, 129, 132, 135, 139, 141, 144, 147, 149, 153, 156, 159, 163, 165, 169, 172, 175, 177, 180, 183

Offset: 1

Philippe Deléham, Mar 16 2004

Also n such that A033485(n) == 3 (mod 4); see A007413.
Also n such that A029883(n-1) = -1, A036577(n-1) = 0, A036585(n-1) = 1. - Philippe Deléham, Mar 25 2004
The number of odd numbers before the n-th even number in this sequence is a(n). - Philippe Deléham, Mar 27 2004
Numbers n such that {A010060(n-1), A010060(n)}={1,0} where A010060 is the Thue-Morse sequence. - Benoit Cloitre, Jun 16 2006

G. C. Greubel, Table of n, a(n) for n = 1..10000
Aviezri S. Fraenkel, The vile, dopey, evil and odious game players, Discrete Math. 312 (2012), pp. 42-46.
Index entries for 2-automatic sequences.

A036554 := Select[Range[750], OddQ[IntegerExponent[#, 2]] &]; Table[ A036554[[2*n]]/2, {n, 1, 50}] (* G. C. Greubel, Jan 14 2018 *)

is(n)=hammingweight(n-1)%2 && hammingweight(n)%2==0 \\ Charles R Greathouse IV, Mar 26 2013

a(n) = A003159(2*n) = A036554(2*n)/2.
a(n) is asymptotic to 3*n. - Benoit Cloitre, Mar 22 2004
A050292(a(n)) = 2n. - Philippe Deléham, Mar 26 2004

More terms from Benoit Cloitre, Mar 22 2004

A225837 Numbers of form 2^i3^j(6k+1), i, j, k >= 0.

Original entry on oeis.org

1, 2, 3, 4, 6, 7, 8, 9, 12, 13, 14, 16, 18, 19, 21, 24, 25, 26, 27, 28, 31, 32, 36, 37, 38, 39, 42, 43, 48, 49, 50, 52, 54, 55, 56, 57, 61, 62, 63, 64, 67, 72, 73, 74, 75, 76, 78, 79, 81, 84, 85, 86, 91, 93, 96, 97, 98, 100, 103, 104, 108, 109, 110, 111, 112

Offset: 1

Ralf Stephan, May 16 2013

The asymptotic density of this sequence is 1/2. - Amiram Eldar, Apr 03 2022
From Peter Munn, Nov 16 2023: (Start)
Contains all nonzero squares.
Dividing by 5 the terms that are multiples of 5 gives its complement, A225838.
(A352272, 2*A352272, 3*A352272, 6*A352272) is a partition of the terms.
The terms form a subgroup of the positive integers under the operation A059897(.,.) and are the positive integers in an index 2 multiplicative subgroup of rationals that is generated by 2, 3 and integers congruent to 1 modulo 6. See A225857 and A352272 for further information about such subgroups.
(End)

Amiram Eldar, Table of n, a(n) for n = 1..10000

Complement of A225838.
Subsequences: A003136\{0}, A083854\{0}, A260488\{0}, A352272.
Symmetric difference of A026225 and A036554; of A036668 and A189716.
Cf. A016921, A059897, A225857.

[n: n in [1..200] | IsOne(d mod 6) where d is n div (2^Valuation(n,2)*3^Valuation(n,3))]; // Bruno Berselli, May 16 2013

mx = 122; t = {}; Do[n = 2^i*3^j (6 k + 1); If[n <= mx, AppendTo[t, n]], {i, 0, Log[2, mx]}, {j, 0, Log[3, mx]}, {k, 0, mx/6}]; Union[t] (* T. D. Noe, May 16 2013 *)

for(n=1,200,t=n/(2^valuation(n,2)*3^valuation(n,3));if((t%6==1),print1(n,",")))

from sympy import integer_log
def A225837(n):
    def bisection(f,kmin=0,kmax=1):
        while f(kmax) > kmax: kmax <<= 1
        kmin = kmax >> 1
        while kmax-kmin > 1:
            kmid = kmax+kmin>>1
            if f(kmid) <= kmid:
                kmax = kmid
            else:
                kmin = kmid
        return kmax
    def f(x): return n+x-sum(((x//3**i>>j)+5)//6 for i in range(integer_log(x,3)[0]+1) for j in range((x//3**i).bit_length()))
    return bisection(f,n,n) # Chai Wah Wu, Feb 02 2025

A372576 a(n) = A276085(n) mod 360, where A276085 is the primorial base log-function.

Original entry on oeis.org

0, 1, 2, 2, 6, 3, 30, 3, 4, 7, 210, 4, 150, 31, 8, 4, 150, 5, 30, 8, 32, 211, 210, 5, 12, 151, 6, 32, 150, 9, 30, 5, 212, 151, 36, 6, 210, 31, 152, 9, 210, 33, 330, 212, 10, 211, 150, 6, 60, 13, 152, 152, 210, 7, 216, 33, 32, 151, 330, 10, 30, 31, 34, 6, 156, 213, 30, 152, 212, 37, 210, 7, 150, 211, 14, 32, 240

Offset: 1

Antti Karttunen, May 25 2024

nonn

Completely additive modulo 360.

On average, every third term is a multiple of 4. See A369001.

Antti Karttunen, Table of n, a(n) for n = 1..16384
Index entries for sequences related to primorial numbers

Cf. A002110, A276085.

Cf. A003159 (positions of even terms), A036554 (of odd terms), A035263, A096268 (parity of terms), A369001, A369002 (positions of multiples of 4).

A002110(n) = prod(i=1,n,prime(i));
A276085(n) = { my(f = factor(n)); sum(k=1, #f~, f[k, 2]*A002110(primepi(f[k, 1])-1)); };
A372576(n) = (A276085(n)%360);

cp's OEIS Frontend

A161673 Positions n such that A010060(n) + A010060(n+8) = 1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

Extensions

A332821 One part of a 3-way classification of the positive integers. Numbers n for which A048675(n) == 1 (mod 3).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Formula

A332822 One part of a 3-way classification of the positive integers. Numbers n for which A048675(n) == 2 (mod 3).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI

Formula

A372586 Numbers k such that (sum of binary indices of k) + (sum of prime indices of k) is odd.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A372589 Numbers k > 1 such that (greatest binary index of k) + (greatest prime index of k) is even.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

Formula

A372590 Numbers whose binary weight (A000120) plus bigomega (A001222) is odd.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

A036552 List of pairs (m,2m) where m is the least unused positive number.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Mathematica

PARI

A091785 Evil numbers (see A001969) in A003159.

Views

Author

Keywords

Comments

Links

Programs

A225837 Numbers of form 2^i3^j(6k+1), i, j, k >= 0.