A003159 -id:A003159 - cp's OEIS frontend

A374132 The 2-adic valuation of A276085(n), where A276085 is the primorial base log-function.

0, 1, 1, 1, 0, 1, 0, 2, 0, 1, 2, 1, 0, 3, 2, 1, 0, 1, 3, 5, 0, 1, 0, 2, 0, 1, 5, 1, 0, 1, 0, 2, 0, 2, 1, 1, 0, 3, 0, 1, 0, 1, 2, 1, 0, 1, 1, 2, 0, 4, 3, 1, 0, 3, 0, 4, 0, 1, 1, 1, 0, 1, 1, 2, 0, 1, 4, 2, 0, 1, 0, 1, 0, 1, 4, 4, 0, 1, 1, 3, 0, 1, 1, 2, 0, 3, 0, 1, 0, 2, 2, 4, 0, 2, 0, 1, 0, 1, 1, 1, 0, 1, 0, 1, 0, 1, 3

Offset: 2

Antti Karttunen, Jun 30 2024

nonn

Antti Karttunen, Table of n, a(n) for n = 2..100000

Cf. A007814, A276085.
Cf. A036554 (indices of 0's), A003159 (of nonzero terms), A373142 (of 1's), A373267 (of 2's), A369002 (of terms >= 2), A373138 (of terms >= 3).
Cf. also A374133.

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

a(n) = A007814(A276085(n)).

A084087 Numbers k not divisible by 3 such that the exponent of the highest power of 2 dividing k is even.

Original entry on oeis.org

1, 4, 5, 7, 11, 13, 16, 17, 19, 20, 23, 25, 28, 29, 31, 35, 37, 41, 43, 44, 47, 49, 52, 53, 55, 59, 61, 64, 65, 67, 68, 71, 73, 76, 77, 79, 80, 83, 85, 89, 91, 92, 95, 97, 100, 101, 103, 107, 109, 112, 113, 115, 116, 119, 121, 124, 125, 127, 131

Offset: 1

Ralf Stephan, May 11 2003

Numbers that are in both A001651 and A003159.
Numbers that are in either A084088 or A084089.
Complement of union of ({k==0 (mod 3)}, {2a(n)}) (A084090).
It seems that lim_{n->infinity} a(n)/n = 9/4. [This is true. The asymptotic density of this sequence is 4/9. - Amiram Eldar, Jan 16 2022]
Positions of nonzero coefficients in the expansion of Sum_{k>=0} x^2^k/(1 + x^2^k + x^2^(k+1)) (A084091).

Amiram Eldar, Table of n, a(n) for n = 1..10000 (terms 1..1000 from Harvey P. Dale)
Index entries for 2-automatic sequences.

Disjoint union of A084089 and A084090.
Intersection of A001651 and A003159.
Also subsequence of A036668, A339690.
Cf. A084088, A084091.

Select[Range[200],Mod[#,3]!=0&&EvenQ[IntegerExponent[#,2]]&] (* Harvey P. Dale, May 15 2018 *)

for(n=0,100,if(valuation(n,2)%2==0&&n%3,print1(n",")))

A084089 Numbers k such that k == 1 (mod 3) and the exponent of the highest power of 2 dividing k is even.

Original entry on oeis.org

1, 4, 7, 13, 16, 19, 25, 28, 31, 37, 43, 49, 52, 55, 61, 64, 67, 73, 76, 79, 85, 91, 97, 100, 103, 109, 112, 115, 121, 124, 127, 133, 139, 145, 148, 151, 157, 163, 169, 172, 175, 181, 187, 193, 196, 199, 205, 208, 211, 217, 220, 223, 229, 235

Offset: 1

Ralf Stephan, May 11 2003

Numbers that are both in A016777 and A003159.
It seems that lim_{n->oo} a(n)/n = 9/2. [This is true. The asymptotic density of this sequence is 2/9. - Amiram Eldar, Jan 16 2022]
Positions of +1 in the expansion of Sum_{k>=0} x^2^k/(1+x^2^k+x^2^(k+1)) (A084091).

Amiram Eldar, Table of n, a(n) for n = 1..10000
Index entries for 2-automatic sequences.

Intersection of A003159 and A016777.
Cf. A084091.
A352274 without the multiples of 3.

Select[3 * Range[0, 81] + 1, EvenQ[IntegerExponent[#, 2]] &] (* Amiram Eldar, Jan 16 2022 *)

for(n=0,300,if(valuation(n,2)%2==0&&n%3==1,print1(n",")))

from itertools import count, islice
def A084089_gen(): # generator of terms
    return filter(lambda n:(n&-n).bit_length()&1,count(1,3))
A084089_list = list(islice(A084089_gen(),30)) # Chai Wah Wu, Jul 11 2022

A102840 a(0)=0, a(1)=1, a(n)=((2n-1)a(n-1)-5na(n-2))/(n-1).

Original entry on oeis.org

0, 1, 3, 0, -20, -45, 21, 308, 540, -585, -4235, -5676, 11232, 54145, 51975, -182400, -654160, -380205, 2680425, 7516400, 1320900, -36753255, -82175665, 24032700, 477852900, 850446025, -749925189, -5944471092, -8220606800, 14049061455, 71102953305, 71989187536, -220682377872

Offset: 0

Benoit Cloitre, Feb 27 2005

sign

n divides a(n) iff the binary representation of n ends with an even number of zeros (i.e. n is in A003159)

Harvey P. Dale, Table of n, a(n) for n = 0..1000

Cf. A102839, A343773.

RecurrenceTable[{-5 n a[n-2] + (2*n - 1) a[n-1] + (1 - n) a[n] ==
0, a[0] == 0, a[1] == 1}, a, {n, 0, 30}] (* Vaclav Kotesovec, Feb 15 2019 *)
nxt[{n_,a_,b_}]:={n+1,b,(b(2n+1)-5a(n+1))/n}; NestList[nxt,{1,0,1},40][[;;,2]] (* Harvey P. Dale, Apr 22 2024 *)

a(n)=if(n<2,if(n,1,0),1/(n-1)*((2*n-1)*a(n-1)-5*n*a(n-2)))

log(abs(a(n))) is asymptotic to c*n where c=0.80... [c = log(5)/2 = 0.8047189562... - Vaclav Kotesovec, Feb 15 2019]
a(n) ~ sqrt(n) * 5^(n/2) / sqrt(8*Pi) * ((sqrt(2 + sqrt(5)) + sqrt(38 + 25*sqrt(5)) / (16*n)) * sin(n*arctan(2)) - (sqrt(-2 + sqrt(5)) - sqrt(-38 + 25*sqrt(5)) / (16*n)) * cos(n*arctan(2))). - Vaclav Kotesovec, Feb 15 2019
From Seiichi Manyama, Jul 09 2024: (Start)
G.f.: x/(1 - 2*x + 5*x^2)^(3/2).
a(n+1) = binomial(n+2,2) * A343773(n). (End)

A214682 Remove 2's that do not contribute to a factor of 4 from the prime factorization of n.

Original entry on oeis.org

1, 1, 3, 4, 5, 3, 7, 4, 9, 5, 11, 12, 13, 7, 15, 16, 17, 9, 19, 20, 21, 11, 23, 12, 25, 13, 27, 28, 29, 15, 31, 16, 33, 17, 35, 36, 37, 19, 39, 20, 41, 21, 43, 44, 45, 23, 47, 48, 49, 25, 51, 52, 53, 27, 55, 28, 57, 29

Offset: 1

Tyler Ball, Jul 25 2012

In this sequence, the number 4 exhibits some characteristics of a prime number since all extraneous 2's have been removed from the prime factorizations of all other numbers.

			For n=8, v_4(8)=1, v_2(8)=3, so a(8)=(8*4^1)/(2^3)=4.
For n=12, v_4(12)=1, v_2(12)=2, so a(12)=(12*4^1)/(2^2)=12.

Charles R Greathouse IV, Table of n, a(n) for n = 1..10000

Cf. A214681, A214685.
Range of values: A003159.
Missing values: A036554.
A056832, A059895, A073675 are used in a formula defining this sequence.
A059897 is used to express relationship between terms of this sequence.
Cf. A007814 (v_2(n)), A235127 (v_4(n)).

a[n_] := n/(2^Mod[IntegerExponent[n, 2], 2]); Array[a, 100] (* Amiram Eldar, Dec 09 2020 *)

a(n)=n>>(valuation(n,2)%2) \\ Charles R Greathouse IV, Jul 26 2012

def A214682(n): return n>>1 if (~n&n-1).bit_length()&1 else n # Chai Wah Wu, Jan 09 2023

C = []
for i in [1..n]:
    C.append(i*4^(Integer(i).valuation(4))/2^(Integer(i).valuation(2)))

a(n) = (n*4^(v_4(n)))/(2^(v_2(n))) where v_k(n) is the k-adic valuation of n. That is, v_k(n) is the largest power of k, a, such that k^a divides n.
For n odd, a(n)=n since n has no factors of 2 (or 4).
From Peter Munn, Nov 29 2020: (Start)
a(A003159(n)) = n.
a(A036554(n)) = n/2.
a(n) = n/A056832(n) = n/A059895(n, 2) = min(n, A073675(n)).
a(A059897(n, k)) = A059897(a(n), a(k)). (End)
Multiplicative with a(2^e) = 2^(2*floor(e/2)), and a(p^e) = p^e for odd primes p. - Amiram Eldar, Dec 09 2020
Sum_{k=1..n} a(k) ~ (5/12) * n^2. - Amiram Eldar, Nov 10 2022
Dirichlet g.f.: zeta(s-1)*(2^s+1)/(2^s+2). - Amiram Eldar, Dec 30 2022

A334748 Let p be the smallest odd prime not dividing the squarefree part of n. Multiply n by p and divide by the product of all smaller odd primes.

Original entry on oeis.org

3, 6, 5, 12, 15, 10, 21, 24, 27, 30, 33, 20, 39, 42, 7, 48, 51, 54, 57, 60, 35, 66, 69, 40, 75, 78, 45, 84, 87, 14, 93, 96, 55, 102, 105, 108, 111, 114, 65, 120, 123, 70, 129, 132, 135, 138, 141, 80, 147, 150, 85, 156, 159, 90, 165, 168, 95, 174, 177, 28, 183, 186, 189

Offset: 1

Peter Munn, May 09 2020

A permutation of A028983.
A007417 (which has asymptotic density 3/4) lists index n such that a(n) = 3n. The sequence maps the terms of A007417 1:1 onto A145204\{0}, defining a bijection between them.
Similarly, bijections are defined from the odd numbers (A005408) to the nonsquare odd numbers (A088828), from the positive even numbers (A299174) to A088829, from A003159 to the nonsquares in A003159, and from A325424 to the nonsquares in A036668. The latter two bijections are between sets where membership depends on whether a number's squarefree part divides by 2 and/or 3.

			84 = 21*4 has squarefree part 21 (and square part 4). The smallest odd prime absent from 21 = 3*7 is 5 and the product of all smaller odd primes is 3. So a(84) = 84*5/3 = 140.

Permutation of A028983.
Row 3, and therefore column 3, of A331590. Cf. A334747 (row 2).
A007913, A034386, A225546, A284723 are used in formulas defining the sequence.
The formula section details how the sequence maps the terms of A003961, A019565, A070826; and how f(a(n)) relates to f(n) for f = A008833, A048675, A267116; making use of A003986.
Subsequences: A016051, A145204\{0}, A329575.
Bijections are defined that relate to A003159, A005408, A007417, A036668, A088828, A088829, A299174, A325424.

a(n) = {my(c=core(n), m=n); forprime(p=3, , if(c % p, m*=p; break, m/=p)); m;} \\ Michel Marcus, May 22 2020

a(n) = n * p / (A034386(p-1)/2), where p = A284723(A007913(n)).
a(n) = A334747(A334747(n)).
a(n) = A331590(3, n) = A225546(4 * A225546(n)).
a(2*n) = 2 * a(n).
a(A019565(n)) = A019565(n+2).
a(k * m^2) = a(k) * m^2.
a(A003961(n)) = A003961(A334747(n)).
a(A070826(n)) = prime(n+1).
A048675(a(n)) = A048675(n) + 2.
A008833(a(n)) = A008833(n).
A267116(a(n)) = A267116(n) OR 1, where OR denotes the bitwise operation A003986.
a(A007417(n)) = A145204(n+1) = 3 * A007417(n).

A334832 Numbers whose squarefree part is congruent to 1 (mod 24).

Original entry on oeis.org

1, 4, 9, 16, 25, 36, 49, 64, 73, 81, 97, 100, 121, 144, 145, 169, 193, 196, 217, 225, 241, 256, 265, 289, 292, 313, 324, 337, 361, 385, 388, 400, 409, 433, 441, 457, 481, 484, 505, 529, 553, 576, 577, 580, 601, 625, 649, 657, 673, 676, 697, 721, 729, 745, 769, 772, 784, 793, 817, 841

Offset: 1

Peter Munn, Jun 15 2020

Closed under multiplication.
The sequence forms a subgroup of the positive integers under the commutative operation A059897(.,.). A059897 has a relevance to squarefree parts that arises from the identity A007913(k*m) = A059897(A007913(k), A007913(m)), where A007913(n) is the squarefree part of n.
The subgroup is one of 8 A059897(.,.) subgroups of the form {k : A007913(k) == 1 (mod m)}. The list seems complete, in anticipation of proof that such sets form subgroups only when m is a divisor of 24 (based on the property described by A. G. Astudillo in A018253). This sequence might be viewed as primitive with respect to the other 7, as the latter correspond to subgroups of its quotient group, in the sense that each one (as a set) is also a union of cosets described below. The 7 include A003159 (m=2), A055047 (m=3), A277549 (m=4), A234000 (m=8) and the trivial A000027 (m=1).
The subgroup has 32 cosets. For each i in {1, 5, 7, 11, 13, 17, 19, 23}, j in {1, 2, 3, 6} there is a coset {n : n = k^2 * (24m + i) * j, k >= 1, m >= 0}. The divisors of 2730 = 2*3*5*7*13 form a transversal. (11, clearly not such a divisor, is in the same coset as 35 = 11 + 24; 17, 19, 23 are in the same cosets as 65, 91, 455 respectively.)
The asymptotic density of this sequence is 1/16. - Amiram Eldar, Mar 08 2021

			The squarefree part of 26 is 26, which is congruent to 2 (mod 24), so 26 is not in the sequence.
The squarefree part of 292 = 2^2 * 73 is 73, which is congruent to 1 (mod 24), so 292 is in the sequence.

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Quotient Group.
Eric Weisstein's World of Mathematics, Right Transversal.

A subgroup under A059897, defined using A007913.
Subsequences: A000290\{0}, A103214, A107008.
Equivalent sequences modulo other members of A018253: A000027 (1), A003159 (2), A055047 (3), A277549 (4), A352272(6), A234000 (8).

Select[Range[850], Mod[Sqrt[#] /. (c_ : 1)*a_^(b_ : 0) :> (c*a^b)^2, 24] == 1 &] (* Michael De Vlieger, Jun 24 2020 *)

isok(m) = core(m) % 24 == 1; \\ Peter Munn, Jun 21 2020

from sympy import integer_log
def A334832(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//(i<<(j<<1))-1)//24+1 for i in (9**k for k in range(integer_log(x,9)[0]+1)) for j in range((x//i>>1).bit_length()+1))
    return bisection(f,n,n) # Chai Wah Wu, Mar 21 2025

{a(n)} = {n : n = k^2 * (24m + 1), k >= 1, m >= 0}.

A352273 Numbers whose squarefree part is congruent to 5 modulo 6.

Original entry on oeis.org

5, 11, 17, 20, 23, 29, 35, 41, 44, 45, 47, 53, 59, 65, 68, 71, 77, 80, 83, 89, 92, 95, 99, 101, 107, 113, 116, 119, 125, 131, 137, 140, 143, 149, 153, 155, 161, 164, 167, 173, 176, 179, 180, 185, 188, 191, 197, 203, 207, 209, 212, 215, 221, 227, 233, 236, 239, 245, 251

Offset: 1

Peter Munn, Mar 10 2022

Numbers of the form 4^i * 9^j * (6k+5), i, j, k >= 0.
1/5 of each multiple of 5 in A352272.
The product of any two terms is in A352272.
The product of a term of this sequence and a term of A352272 is a term of this sequence.
The positive integers are usefully partitioned as {A352272, 2*A352272, 3*A352272, 6*A352272, {a(n)}, 2*{a(n)}, 3*{a(n)}, 6*{a(n)}}. There is a table in the example section giving sequences formed from unions of the parts.
The parts correspond to the cosets of A352272 considered as a subgroup of the positive integers under the operation A059897(.,.). Viewed another way, the parts correspond to the intersection of the integers with the cosets of the multiplicative subgroup of the positive rationals generated by the terms of A352272.
The asymptotic density of this sequence is 1/4. - Amiram Eldar, Apr 03 2022

			The squarefree part of 11 is 11, which is congruent to 5 (mod 6), so 11 is in the sequence.
The squarefree part of 15 is 15, which is congruent to 3 (mod 6), so 15 is not in the sequence.
The squarefree part of 20 = 2^2 * 5 is 5, which is congruent to 5 (mod 6), so 20 is in the sequence.
The table below lists OEIS sequences that are unions of the cosets described in the initial comments, and indicates the cosets included in each sequence. A352272 (as a subgroup) is denoted H, and this sequence (as a coset) is denoted H/5, in view of its terms being one fifth of the multiples of 5 in A352272.
             H    2H    3H    6H    H/5  2H/5  3H/5  6H/5
A003159      X           X           X           X
A036554            X           X           X           X
.
A007417      X     X                 X     X
A145204\{0}              X     X                 X     X
.
A026225      X           X                 X           X
A026179\{1}        X           X     X           X
.
A036668      X                 X     X                 X
A325424            X     X                 X     X
.
A055047      X                             X
A055048            X                 X
A055041                  X                             X
A055040                        X                 X
.
A189715      X                 X           X     X
A189716            X     X           X                 X
.
A225837      X     X     X     X
A225838                              X     X     X     X
.
A339690      X                       X
A329575                  X                       X
.
A352274      X           X
(The sequence groupings in the table start with the subgroup of the quotient group of H, followed by its cosets.)

Amiram Eldar, Table of n, a(n) for n = 1..10000
Eric Weisstein's World of Mathematics, Squarefree Part.

Intersection of any three of A003159, A007417, A189716 and A225838.
Intersection of A036668 and A055048.
Complement within A339690 of A352272.
Cf. A007913, A059897, A307151, A334832.
Closure of A084088 under multiplication by 9.
Other subsequences: A033429\{0}, A016969.
Other sequences in the example table: A036554, A145204, A026179, A026225, A325424, A055040, A055041, A055047, A189715, A225837, A329575, A352274.

q[n_] := Module[{e2, e3}, {e2, e3} = IntegerExponent[n, {2, 3}]; EvenQ[e2] && EvenQ[e3] && Mod[n/2^e2/3^e3, 6] == 5]; Select[Range[250], q] (* Amiram Eldar, Apr 03 2022 *)

PARI
```
isok(m) = core(m) % 6 == 5;
```

from itertools import count
def A352273(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):
        c = n+x
        for i in count(0):
            i2 = 9**i
            if i2>x: break
            for j in count(0,2):
                k = i2<x: break
                c -= (x//k-5)//6+1
        return c
    return bisection(f,n,n) # Chai Wah Wu, Feb 14 2025

{a(n) : n >= 1} = {m >= 1 : A007913(m) == 5 (mod 6)}.
{a(n) : n >= 1} = A334832/5 U A334832/11 U A334832/17 U A334832/23 where A334832/k denotes {A334832(m)/k : m >= 1, k divides A334832(m)}.
Using the same notation, {a(n) : n >= 1} = A352272/5 = {A307151(A352272(m)) : m >= 1}.
{A225838(n) : n >= 1} = {m : m = a(j)*k, j >= 1, k divides 6}.

A352274 Numbers whose squarefree part is congruent to 1 modulo 6 or 3 modulo 18.

Original entry on oeis.org

1, 3, 4, 7, 9, 12, 13, 16, 19, 21, 25, 27, 28, 31, 36, 37, 39, 43, 48, 49, 52, 55, 57, 61, 63, 64, 67, 73, 75, 76, 79, 81, 84, 85, 91, 93, 97, 100, 103, 108, 109, 111, 112, 115, 117, 121, 124, 127, 129, 133, 139, 144, 145, 147, 148, 151, 156, 157, 163, 165, 169, 171, 172

Offset: 1

Peter Munn, Mar 10 2022

Numbers of the form 4^i * 3^j * (6k+1), i, j, k >= 0. Numbers whose prime factorization has an even number of factors of 2 and an even number of factors of the form 6k+5 (therefore also an even number of factors of the form 3k+2).
Closed under multiplication.
Includes the nonzero Loeschian numbers (A003136). The two sequences have few early differences (the first extra number here is a(22) = 55, followed by 85, 115, 145, ...), but their densities diverge progressively, driven by the presence here - and absence from A003136 - of the nonsquare terms of A108166. Asymptotic densities are 1/3 and 0 respectively.
Term by term, the sequence is one half of its complement within A225837.

			4 = 2^2 has square part 2^2, therefore squarefree part 4/2^2 = 1, which is congruent to 1 mod 6, so 4 is in the sequence.
63 = 3^2 * 7 has square part 3^2, therefore squarefree part 63/3^2 = 7, which is congruent to 1 mod 6, so 63 is in the sequence.
21 = 3*7 has square part 1^2 and squarefree part 21, which is congruent to 3 mod 18, so 21 is in the sequence.
72 = 2^3 * 3^2 has square part 2^2 * 3^2 = 6^2, therefore squarefree part 72/6^2 = 2, which is congruent to 2 mod 6 and to 2 mod 18, so 72 is not in the sequence.

Eric Weisstein's World of Mathematics, Squarefree Part.

Intersection of any two of A003159, A026225 and A225837.
Closure of A084089 under multiplication by 3.
Cf. A007913.
Subsequences: A003136\{0}, A108166, A352272.

isok(m) = core(m) % 6 == 1 || core(m) % 18 == 3;

from itertools import count
def A352274(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):
        c = n+x
        for i in count(0,2):
            i2 = 1<x:
                break
            for j in count(0):
                k = i2*3**j
                if k>x:
                    break
                c -= (x//k-1)//6+1
        return c
    return bisection(f,n,n) # Chai Wah Wu, Feb 14 2025

Formula

{a(n): n >= 1} = {m >= 1 : A007913(m) == 1 (mod 6)} U {m >= 1 : A007913(m) == 3 (mod 18)} = {A352272(m): m >= 1} U {3*A352272(m): m >= 1}.

{A225837(n): n >= 1} = {a(m): m >= 1} U {2*a(m): m >= 1}.

cp's OEIS Frontend

A374132 The 2-adic valuation of A276085(n), where A276085 is the primorial base log-function.

Views

Author

Keywords

Links

Crossrefs

Programs

PARI

Formula

A084087 Numbers k not divisible by 3 such that the exponent of the highest power of 2 dividing k is even.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A084089 Numbers k such that k == 1 (mod 3) and the exponent of the highest power of 2 dividing k is even.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Python

A102840 a(0)=0, a(1)=1, a(n)=((2*n-1)*a(n-1)-5*n*a(n-2))/(n-1).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A214682 Remove 2's that do not contribute to a factor of 4 from the prime factorization of n.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

SageMath

Formula

A334748 Let p be the smallest odd prime not dividing the squarefree part of n. Multiply n by p and divide by the product of all smaller odd primes.

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

PARI

Formula

A334832 Numbers whose squarefree part is congruent to 1 (mod 24).

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

A352273 Numbers whose squarefree part is congruent to 5 modulo 6.

A102840 a(0)=0, a(1)=1, a(n)=((2n-1)a(n-1)-5na(n-2))/(n-1).