A364546 -id:A364546 - cp's OEIS frontend

A029747 Numbers of the form 2^k times 1, 3 or 5.

1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 20, 24, 32, 40, 48, 64, 80, 96, 128, 160, 192, 256, 320, 384, 512, 640, 768, 1024, 1280, 1536, 2048, 2560, 3072, 4096, 5120, 6144, 8192, 10240, 12288, 16384, 20480, 24576, 32768, 40960, 49152, 65536, 81920, 98304, 131072, 163840, 196608

Offset: 1

N. J. A. Sloane

Fixed points of the Doudna sequence: A005940(a(n)) = A005941(a(n)) = a(n). - Reinhard Zumkeller, Aug 23 2006
Subsequence of A103969. - R. J. Mathar, Mar 06 2010
Question: Is there a simple proof that A005940(c) = c would never allow an odd composite c as a solution? See also my comments in A163511 and in A335431 concerning similar problems, also A364551 and A364576. - Antti Karttunen, Jul 28 & Aug 11 2023

			128 = 2^7 * 1 is in the sequence as well as 160 = 2^5 * 5. - _David A. Corneth_, Sep 18 2020

David A. Corneth, Table of n, a(n) for n = 1..9963 (terms <= 10^1000)
Index entries for linear recurrences with constant coefficients, signature (0,0,2).

Cf. A122132, A000079, A007283, A020714, A130793.
Cf. A005940, A005941, A163511, A335431, A364499, A364551, A364576.
Subsequence of the following sequences: A103969, A253789, A364541, A364542, A364544, A364546, A364548, A364550, A364560, A364565.
Even terms form a subsequence of A320674.

m = 200000; Select[Union @ Flatten @ Outer[Times, {1, 3, 5}, 2^Range[0, Floor[Log2[m]]]], # < m &] (* Amiram Eldar, Oct 15 2020 *)

is(n) = n>>valuation(n, 2) <= 5 \\ David A. Corneth, Sep 18 2020

def A029747(n):
    if n<3: return n
    a, b = divmod(n,3)
    return 1<Chai Wah Wu, Apr 02 2025

a(n) = if n < 6 then n else 2*a(n-3). - Reinhard Zumkeller, Aug 23 2006
G.f.: (1+x+x^2)^2/(1-2*x^3). - R. J. Mathar, Mar 06 2010
Sum_{n>=1} 1/a(n) = 46/15. - Amiram Eldar, Oct 15 2020

Edited by David A. Corneth and Peter Munn, Sep 18 2020

A364502 a(n) = A005940(n) / gcd(n, A005940(n)).

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 9, 1, 7, 1, 15, 1, 25, 9, 9, 1, 11, 7, 21, 1, 5, 15, 45, 1, 49, 25, 25, 9, 125, 9, 81, 1, 13, 11, 33, 7, 55, 21, 21, 1, 77, 5, 105, 15, 35, 45, 135, 1, 121, 49, 49, 25, 245, 25, 45, 9, 343, 125, 375, 9, 625, 81, 27, 1, 17, 13, 39, 11, 65, 33, 99, 7, 91, 55, 11, 21, 25, 21, 189, 1, 143, 77, 231, 5

Offset: 1

Antti Karttunen, Jul 28 2023

Denominator of n / A005940(n).

Antti Karttunen, Table of n, a(n) for n = 1..16384

Cf. A005940, A364500, A364501 (numerators), A364546 (positions of 1's).

Cf. also A364492.

nn = 84; Array[Set[a[#], #] &, 2]; Do[If[EvenQ[n], Set[a[n], 2 a[n/2]], Set[a[n], Times @@ Power @@@ Map[{Prime[PrimePi[#1] + 1], #2} & @@ # &, FactorInteger[a[(n + 1)/2]]]]], {n, 3, nn}]; Array[a[#]/GCD[a[#], #] &, nn] (* Michael De Vlieger, Jul 28 2023 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A364502(n) = { my(u=A005940(n)); (u / gcd(n, u)); };

A364547 Odd numbers k such that k is a multiple of A005940(k).

Original entry on oeis.org

1, 3, 5, 1035, 524295, 16777217

Offset: 1

Antti Karttunen, Jul 28 2023

Sequence A005941(A364549(.)) sorted into ascending order.
Those terms of A000051 (= 2^k + 1) are included that have A000040(1+k) as one of their prime factors.
a(7) > 402653184.
See also comments in A364963. - Antti Karttunen, Jan 12 2024

			1035 is included because 1034 in binary is "10000001010", which Doudna isomorphism maps to 345 = 3*5*23, which thus divides 1035 (= 3^2 * 5 * 23). Note that there are six 0's in the binary representation between its most significant bit and the trailing "1010", thus we get the prime factors A000040(1+1) = 3, A000040(1+1+1) = 5 and A000040(1+1+1+6) = 23.
524295 is included because 524294 in binary is "10000000000000000110", which Doudna isomorphism maps to 549 = 3^2 * 61, which thus divides 524295 (= 3^2 * 5 * 61 * 191). Note that there are sixteen 0's in the binary representation between its most significant bit and the trailing "110", thus we get the prime factors A000040(2) = 3 and A000040(2+16) = 61.
16777217 = 2^24 + 1 is included because A000040(1+24) = 97, and 16777217 = 97*257*673.

Odd terms in A364546.
Cf. A000040, A000051, A005940, A005941, A364502, A364549.
Cf. also A364545, A364551, A364963.

nn = 2^20 + 2; Array[Set[a[#], #] &, 2]; {1}~Join~Reap[Do[If[EvenQ[n], Set[a[n], 2 a[n/2]], a[n] = k = Times @@ Power @@@ Map[{Prime[PrimePi[#1] + 1], #2} & @@ # &, FactorInteger[a[(n + 1)/2]]]; If[Divisible[n, a[n]], Sow[n]]], {n, 3, nn}] ][[-1, 1]] (* Michael De Vlieger, Jul 28 2023 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
isA364547(n) = ((n%2)&&!(n%A005940(n)));

A364548 Numbers k such that k divides A005941(k).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 20, 24, 32, 40, 48, 64, 80, 96, 97, 128, 160, 192, 194, 256, 320, 345, 384, 388, 512, 549, 640, 690, 768, 776, 1024, 1093, 1098, 1280, 1380, 1536, 1552, 2048, 2186, 2196, 2560, 2760, 3072, 3104, 4096, 4372, 4392, 5120, 5520, 6144, 6208, 8192, 8744, 8784, 10240, 11040, 12288, 12416, 16384

Offset: 1

Antti Karttunen, Jul 28 2023

nonn

Numbers k such that k divides 1+A156552(k).
Sequence A005940(A364546(.)) sorted into ascending order.
If k is a term, then also 2*k is present in this sequence, and vice versa.

Cf. A005940, A005941, A156552, A364546.
Subsequences: A029747, A364549 (odd terms).
Cf. also A364497.

A005941(n) = { my(f=factor(n), p, p2=1, res=0); for(i=1, #f~, p = 1 << (primepi(f[i, 1])-1); res += (p * p2 * (2^(f[i, 2])-1)); p2 <<= f[i, 2]); (1+res) }; \\ (After David A. Corneth's program for A156552)
isA364548(n) = !(A005941(n)%n);

A364544 Numbers k such that k divides A005940(k).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 8, 10, 12, 16, 20, 24, 32, 40, 48, 64, 80, 96, 125, 128, 160, 192, 245, 250, 256, 320, 375, 384, 490, 500, 512, 640, 715, 750, 768, 845, 847, 980, 1000, 1024, 1215, 1280, 1430, 1500, 1536, 1690, 1694, 1960, 2000, 2048, 2430, 2560, 2860, 2873, 3000, 3072, 3380, 3388, 3920, 4000, 4096, 4860, 5120

Offset: 1

Antti Karttunen, Jul 28 2023

nonn

If k is a term, then also 2*k is present in this sequence, and vice versa.

A029747 is included as a subsequence, because it gives the known fixed points of map n -> A005940(n).

Positions of 1's in A364501.
Subsequence of A364542.
Subsequences: A029747, A364545 (odd terms).
Cf. A005940.
Cf. also A364494, A364546.

nn = 5120; Array[Set[a[#], #] &, 2]; Do[If[EvenQ[n], Set[a[n], 2 a[n/2]], Set[a[n], Times @@ Power @@@ Map[{Prime[PrimePi[#1] + 1], #2} & @@ # &, FactorInteger[a[(n + 1)/2]]]]], {n, 3, nn}]; Select[Range[nn], Divisible[a[#], #] &] (* Michael De Vlieger, Jul 28 2023 *)

A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
isA364544(n) = !(A005940(n)%n);

cp's OEIS Frontend

A029747 Numbers of the form 2^k times 1, 3 or 5.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Python

Formula

Extensions

A364502 a(n) = A005940(n) / gcd(n, A005940(n)).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

A364547 Odd numbers k such that k is a multiple of A005940(k).

Views

Author

Keywords

Comments

Examples

Crossrefs

Programs

Mathematica

PARI

A364548 Numbers k such that k divides A005941(k).

Views

Author

Keywords

Comments

Crossrefs

Programs

PARI

A364544 Numbers k such that k divides A005940(k).

Views

Author

Keywords

Comments

Crossrefs

Programs

Mathematica

PARI