The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A356886 Write n as 2^m - k, where 2^m is the least power of 2 such that 2^m >= n, and k is a number in the range 0 <= k < 2^(m-1) - 1. Then for n such that k=0, a(n)=n, and for n such that k > 0, a(n) is the smallest odd prime multiple of a(k) that is not already a term. 5
 1, 2, 3, 4, 9, 6, 5, 8, 15, 18, 27, 12, 21, 10, 7, 16, 35, 30, 63, 36, 81, 54, 45, 24, 25, 42, 99, 20, 33, 14, 11, 32, 55, 70, 165, 60, 297, 126, 75, 72, 135, 162, 243, 108, 189, 90, 105, 48, 49, 50, 147, 84, 351, 198, 195, 40, 65, 66, 117, 28, 39, 22, 13, 64, 91 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,2 COMMENTS Conjectured to be a permutation of the positive integers in which the primes appear in order. The even bisection, when divided by 2 reproduces the sequence. Has similar properties to the Doudna sequence, A005940. LINKS Michael De Vlieger, Table of n, a(n) for n = 1..16384 Michael De Vlieger, Annotated fan-style binary tree of a(n), n = 1..2^14, with row m = 2^m..2^(m+1)-1 with a heat map color function showing row minima in blue, larger terms in greens, and row maxima in red. FORMULA a(2^m - 1) = prime(m) for m >= 2. a(2*n)/2 = a(n) for n >= 1. EXAMPLE 5 = 2^3 - 3 so a(5)=a(3)*3=9. 13 = 2^4 - 3 and a(3)=3 so a(13)=3*7=21 since 9 and 15 have appeared already. 17 = 2^5 - 15 and a(15)=7 so a(17)=5*7=35 (since 21=3*7 has appeared already). MATHEMATICA nn = 65; c[_] = False; Do[Set[{m, k}, {2, 2^(Ceiling[Log2[n]]) - n}]; If[k == 0, Set[{a[n], c[n]}, {n, True}], While[Set[t, Prime[m] a[k]]; c[t], m++]; Set[{a[n], c[t]}, {t, True}]], {n, nn}]; Array[a, nn] (* Michael De Vlieger, Sep 02 2022 *) PROG (PARI) first(n) = { my(res = vector(n), m = Map()); for(i = 1, n, qd = ceil(log(i)/log(2)); nextp = 1<

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 September 11 05:04 EDT 2024. Contains 375814 sequences. (Running on oeis4.)