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.

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

Original entry on oeis.org

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

Views

Author

N. J. A. Sloane

Keywords

Comments

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

Examples

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

Links

Crossrefs

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.

Programs

  • Mathematica
    m = 200000; Select[Union @ Flatten @ Outer[Times, {1, 3, 5}, 2^Range[0, Floor[Log2[m]]]], # < m &] (* Amiram Eldar, Oct 15 2020 *)
  • PARI
    is(n) = n>>valuation(n, 2) <= 5 \\ David A. Corneth, Sep 18 2020
  • Python
    def A029747(n):
    if n<3: return n
    a, b = divmod(n,3)
    return 1<Chai Wah Wu, Apr 02 2025

Formula

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

Extensions

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

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

Original entry on oeis.org

1, 1, 1, 1, 1, 1, 7, 1, 9, 1, 11, 1, 13, 7, 5, 1, 17, 9, 19, 1, 3, 11, 23, 1, 25, 13, 9, 7, 29, 5, 31, 1, 33, 17, 35, 9, 37, 19, 13, 1, 41, 3, 43, 11, 9, 23, 47, 1, 49, 25, 17, 13, 53, 9, 11, 7, 57, 29, 59, 5, 61, 31, 7, 1, 65, 33, 67, 17, 69, 35, 71, 9, 73, 37, 5, 19, 7, 13, 79, 1, 81, 41, 83, 3, 17, 43, 29, 11, 89
Offset: 1

Views

Author

Antti Karttunen, Jul 28 2023

Keywords

Comments

Numerator of n / A005940(n).

Links

Crossrefs

Cf. A005940, A364500, A364502 (denominators), A364544 (positions of 1's).
Cf. also A364491.

Programs

  • Mathematica
    nn = 89; 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[#/GCD[a[#], #] &, nn] (* Michael De Vlieger, Jul 28 2023 *)
  • PARI
    A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A364501(n) = (n / gcd(n, A005940(n)));
  • PARI
    A364501(n) = { my(orgn=n,p=2,rl=0,z=1); n--; while(n, if(!(n%2), p=nextprime(1+p), rl++; if(1==(n%4), z *= p^min(rl,valuation(orgn,p)); rl=0)); n>>=1); (orgn/z); };

A364545 Odd numbers k such that k divides A005940(k).

Original entry on oeis.org

1, 3, 5, 125, 245, 375, 715, 845, 847, 1215, 2873, 11583, 12635, 21879, 24255, 31213, 33495, 36125, 42875, 48125, 48841, 71269, 100793, 102245, 104907, 157035, 173641, 191607, 206045, 240787, 244205, 251459, 302575, 313937, 351509, 359513, 375687, 384475, 388531, 417605, 419957, 444889, 468999, 521703, 586177, 635375
Offset: 1

Views

Author

Antti Karttunen, Jul 28 2023

Keywords

Crossrefs

Odd terms in A364544.
Cf. A005940, A364501.
Cf. also A364495, A364547.

Programs

  • Mathematica
    nn = 2^20; 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[1, nn, 2], Divisible[a[#], #] &] (* Michael De Vlieger, Jul 28 2023 *)
  • PARI
    A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
isA364545(n) = ((n%2)&&!(A005940(n)%n));

A364546 Numbers k such that k is a multiple of 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, 128, 160, 192, 256, 320, 384, 512, 640, 768, 1024, 1035, 1280, 1536, 2048, 2070, 2560, 3072, 4096, 4140, 5120, 6144, 8192, 8280, 10240, 12288, 16384, 16560, 20480, 24576, 32768, 33120, 40960, 49152, 65536, 66240, 81920, 98304, 131072, 132480, 163840
Offset: 1

Views

Author

Antti Karttunen, Jul 28 2023

Keywords

Comments

Sequence A005941(A364548(.)) sorted into ascending order.
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).

Crossrefs

Positions of 1's in A364502.
Subsequence of A364541.
Subsequences: A029747, A364547 (odd terms).
Cf. A005940, A364544, A364548.
Cf. also A364496.

Programs

  • Mathematica
    nn = 2^18; 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 *)
  • PARI
    A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
isA364546(n) = !(n%A005940(n));
Showing 1-4 of 4 results.

Started in 1964 by Neil J. A. Sloane | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement.