A255421 -id:A255421 - cp's OEIS frontend

A003309 Ludic numbers: apply the same sieve as Eratosthenes, but cross off every k-th remaining number.

1, 2, 3, 5, 7, 11, 13, 17, 23, 25, 29, 37, 41, 43, 47, 53, 61, 67, 71, 77, 83, 89, 91, 97, 107, 115, 119, 121, 127, 131, 143, 149, 157, 161, 173, 175, 179, 181, 193, 209, 211, 221, 223, 227, 233, 235, 239, 247, 257, 265, 277, 283, 287, 301, 307, 313

Offset: 1

N. J. A. Sloane

The definition can obviously only be applied from k = a(2) = 2 on: for k = 1, all remaining numbers would be deleted. - M. F. Hasler, Nov 02 2024

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

Donovan Johnson, Table of n, a(n) for n = 1..100000
David Applegate, C program for A003309.
Donovan Johnson, Ludic numbers computed up to A003309(1236290) = 23000711.
OEIS Wiki, Ludic numbers.
Popular Computing (Calabasas, CA), Sieves: Problem 43, Vol. 2 (No. 13, Apr 1974), pp. 6-7. This is Sieve #1. [Annotated and scanned copy]
Rosettacode Wiki, Ludic numbers.
Index entries for sequences generated by sieves

Without the initial 1 occurs as the leftmost column in arrays A255127 and A260717.
Cf. A003310, A003311, A100464, A100585, A100586 (variants).
Cf. A192503 (primes in sequence), A192504 (nonprimes), A192512 (number of terms <= n).
Cf. A192490 (characteristic function).
Cf. A192607 (complement).
Cf. A260723 (first differences).
Cf. A255420 (iterates of f(n) = A003309(n+1) starting from n=1).
Subsequence of A302036.
Cf. A237056, A237126, A237427, A235491, A255407, A255408, A255421, A255422, A260435, A260436, A260741, A260742 (permutations constructed from Ludic numbers).
Cf. also A000959, A008578, A255324, A254100, A272565 (Ludic factor of n), A297158, A302032, A302038.
Cf. A376237 (ludic factorial: cumulative product), A376236 (ludic Fortunate numbers).

a003309 n = a003309_list !! (n - 1)
a003309_list = 1 : f [2..] :: [Int]
   where f (x:xs) = x : f (map snd [(u, v) | (u, v) <- zip [1..] xs,
                                             mod u x > 0])
-- Reinhard Zumkeller, Feb 10 2014, Jul 03 2011

ludic:= proc(N) local i, k,S,R;
  S:= {$2..N};
  R:= 1;
  while nops(S) > 0 do
    k:= S[1];
    R:= R,k;
    S:= subsop(seq(1+k*j=NULL, j=0..floor((nops(S)-1)/k)),S);
  od:
[R];
end proc:
ludic(1000); # Robert Israel, Feb 23 2015

t = Range[2, 400]; r = {1}; While[Length[t] > 0, k = First[t]; AppendTo[r, k]; t = Drop[t, {1, -1, k}];]; r (* Ray Chandler, Dec 02 2004 *)

t=vector(399,x,x+1); r=[1]; while(length(t)>0, k=t[1];r=concat(r,[k]);t=vector((length(t)*(k-1))\k,x,t[(x*k+k-2)\(k-1)])); r \\ Phil Carmody, Feb 07 2007

A3309=[1]; next_A003309(n)=nn && break); n+!if(n=setsearch(A3309,n+1,1),return(A3309[n])) \\ Should be made more efficient if n >> max(A3309). - M. F. Hasler, Nov 02 2024
{A003309(n) = while(n>#A3309, next_A003309(A3309[#A3309])); A3309[n]} \\ Should be made more efficient in case n >> #A3309. - M. F. Hasler, Nov 03 2024

upto(nn)= my(r=List([1..nn]), p=1); while(p++<#r, my(k=r[p], i=p); while((i+=k)<=#r, listpop(~r, i); i--)); Vec(r); \\ Ruud H.G. van Tol, Dec 13 2024

remainders = [0]
ludics = [2]
N_MAX = 313
for i in range(3, N_MAX) :
    ludic_index = 0
    while ludic_index < len(ludics) :
        ludic = ludics[ludic_index]
        remainder = remainders[ludic_index]
        remainders[ludic_index] = (remainder + 1) % ludic
        if remainders[ludic_index] == 0 :
            break
        ludic_index += 1
    if ludic_index == len(ludics) :
        remainders.append(0)
        ludics.append(i)
ludics = [1] + ludics
print(ludics)
# Alexandre Herrera, Aug 10 2023

def A003309(): # generator of the infinite list of ludic numbers
    L = [2, 3]; yield 1; yield 2; yield 3
    while k := len(L)//2: # could take min{k | k >= L[-1-k]-1}
        for j in L[-1-k::-1]: k += 1 + k//(j-1)
        L.append(k+2); yield k+2
A003309_upto = lambda N=99: [t for t,_ in zip(A003309(),range(N))]
# M. F. Hasler, Nov 02 2024

(define (A003309 n) (if (= 1 n) n (A255127bi (- n 1) 1))) ;; Code for A255127bi given in A255127.
;; Antti Karttunen, Feb 23 2015

Complement of A192607; A192490(a(n)) = 1. - Reinhard Zumkeller, Jul 05 2011
From Antti Karttunen, Feb 23 2015: (Start)
a(n) = A255407(A008578(n)).
a(n) = A008578(n) + A255324(n).
(End)

More terms from David Applegate and N. J. A. Sloane, Nov 23 2004

A269171 Permutation of natural numbers: a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A269379(a(A268674(2n+1))).

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 23, 20, 21, 22, 25, 24, 19, 26, 27, 28, 29, 30, 37, 32, 33, 34, 35, 36, 41, 46, 39, 40, 43, 42, 47, 44, 45, 50, 53, 48, 31, 38, 51, 52, 61, 54, 49, 56, 57, 58, 67, 60, 71, 74, 63, 64, 65, 66, 77, 68, 69, 70, 83, 72, 89, 82, 75, 92, 59, 78, 91, 80, 81, 86, 97, 84, 79, 94, 87, 88, 107, 90, 85, 100

Offset: 1

Antti Karttunen, Mar 03 2016

nonn

Antti Karttunen, Table of n, a(n) for n = 1..8192
Index entries for sequences that are permutations of the natural numbers

Inverse: A269172.
Cf. A000035, A003309, A008578, A055396, A078898, A268674, A255127, A269379.
Related or similar permutations: A260741, A260742, A269355, A269357, A255421, A252754, A252756, A269385, A269387.
Cf. also A269393 (a(3n)/3) and A269395.
Differs from A255407 for the first time at n=38, where a(38) = 46, while A255407(38) = 38.

a(1) = 1, then after for even n, a(n) = 2*a(n/2), and for odd n, a(n) = A269379(a(A268674(n))).
a(1) = 1, for n > 1, a(n) = A255127(A055396(n), a(A078898(n))).
As a composition of other permutations:
a(n) = A269385(A252756(n)).
a(n) = A269387(A252754(n)).
Other identities. For all n >= 1:
A000035(a(n)) = A000035(n). [Preserves the parity of n.]
a(A008578(n)) = A003309(n). [Maps noncomposites to Ludic numbers.]

A255422 Permutation of natural numbers: a(1) = 1 and for n > 1, if n is k-th ludic number larger than 1 [i.e., n = A003309(k+1)], a(n) = nthprime(a(k)), otherwise, when n is k-th nonludic number [i.e., n = A192607(k)], a(n) = nthcomposite(a(k)), where nthcomposite = A002808, nthprime = A000040.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 20, 21, 22, 24, 19, 25, 23, 26, 27, 28, 29, 32, 33, 34, 36, 30, 38, 35, 31, 39, 40, 42, 37, 44, 41, 48, 49, 50, 43, 52, 45, 55, 51, 46, 47, 56, 57, 60, 54, 63, 58, 68, 53, 69, 70, 62, 74, 64, 59, 77, 72, 65, 61, 66, 78, 80, 84, 76, 71, 87, 81

Offset: 1

Antti Karttunen, Feb 23 2015

The graph has a comet appearance. - Daniel Forgues, Dec 15 2015

			When n = 19 = A192607(11) [the eleventh nonludic number], we look for the value of a(11), which is 11 [all terms less than 19 are fixed because the beginnings of A003309 and A008578 coincide up to A003309(8) = A008578(8) = 17], and then take the eleventh composite number, which is A002808(11) = 20, thus a(19) = 20.
When n = 25 = A003309(10) = A003309(1+9) [the tenth ludic number, and ninth after one], we look for the value of a(9), which is 9 [all terms less than 19 are fixed, see above], and then take the ninth prime number, which is A000040(9) = 23, thus a(25) = 23.

Antti Karttunen, Table of n, a(n) for n = 1..8192
Antti Karttunen, Entanglement Permutations, 2016-2017
Index entries for sequences that are permutations of the natural numbers

Inverse: A255421.
Cf. A000040, A002808, A003309, A192490, A192512, A192607, A236863.
Related or similar permutations: A237427, A246378, A245703, A245704 (compare the scatterplots), A255407, A255408.

a(1)=1; and for n > 1, if A192490(n) = 1 [i.e., n is ludic], a(n) = A000040(a(A192512(n)-1)), otherwise a(n) = A002808(a(A236863(n))) [where A192512 and A236863 give the number of ludic and nonludic numbers <= n, respectively].

As a composition of other permutations: a(n) = A246378(A237427(n)).

A257731 Permutation of natural numbers: a(1) = 1, a(prime(n)) = lucky(1+a(n)), a(composite(n)) = unlucky(a(n)), where prime(n) = n-th prime number A000040, composite(n) = n-th composite number A002808 and lucky = A000959, unlucky = A050505.

Original entry on oeis.org

1, 3, 9, 2, 33, 5, 7, 14, 4, 45, 163, 8, 15, 11, 20, 6, 25, 59, 63, 203, 12, 22, 13, 17, 28, 10, 35, 78, 235, 83, 1093, 251, 18, 30, 19, 24, 31, 39, 16, 47, 67, 101, 43, 290, 107, 1283, 87, 309, 26, 41, 27, 34, 21, 42, 53, 23, 61, 88, 115, 128, 321, 57, 354, 137, 1499, 112, 349, 376, 36, 55, 1401, 38, 49, 46, 29, 56, 70, 32, 99, 81

Offset: 1

Antti Karttunen, May 06 2015

nonn

Antti Karttunen, Table of n, a(n) for n = 1..6185
Index entries for sequences that are permutations of the natural numbers

Inverse: A257732.
Cf. A000040, A000720, A000959, A002808, A010051, A050505, A065855.
Related or similar permutations: A246377, A255421, A257726, A257733.
Cf. also A032600, A255553, A255554.
Differs from A257733 for the first time at n=19, where a(19) = 63, while A257733(19) = 203.

a(1) = 1; for n > 1: if A010051(n) = 1 [i.e., if n is a prime], then a(n) = A000959(1+a(A000720(n))), otherwise a(n) = A050505(a(A065855(n))).
As a composition of other permutations:
a(n) = A257726(A246377(n)).
a(n) = A257733(A255421(n)).

A255324 Difference between the n-th Ludic number and the n-th noncomposite number: a(n) = A003309(n) - A008578(n).

Original entry on oeis.org

0, 0, 0, 0, 0, 0, 0, 0, 4, 2, 0, 6, 4, 2, 4, 6, 8, 8, 10, 10, 12, 16, 12, 14, 18, 18, 18, 18, 20, 22, 30, 22, 26, 24, 34, 26, 28, 24, 30, 42, 38, 42, 42, 36, 40, 38, 40, 36, 34, 38, 48, 50, 48, 60, 56, 56, 66, 62, 66, 64, 72, 76, 68, 70, 72, 76, 80, 76, 78, 72, 72, 78, 74, 70, 72, 84, 84, 86, 84, 92, 88, 84, 88, 86, 94, 96, 98, 104

Offset: 1

Antti Karttunen, Feb 23 2015

nonn

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

Cf. A255325 (the same terms halved).

Cf. A032600, A003309, A008578, A255421, A255422.

t = Range[2, 1000];
A003309 = {1};
While[Length[t]>0, k = t[[1]]; AppendTo[A003309, k]; t = Drop[t, {1, -1, k}]];
a[n_] := If[n == 1, 0, A003309[[n]] - Prime[n - 1]];
Array[a, Length[A003309]] (* Jean-François Alcover, Jan 08 2022, after Ray Chandler in A003309 *)

(define (A255324 n) (- (A003309 n) (A008578 n)))

a(n) = A003309(n) - A008578(n).

a(n) = 2*A255325(n).

A257734 Permutation of natural numbers: a(1) = 1, a(lucky(n)) = ludic(1+a(n-1)), a(unlucky(n)) = nonludic(a(n)), where lucky(n) = n-th lucky number A000959, unlucky(n) = n-th unlucky number A050505, and ludic = A003309, nonludic = A192607.

Original entry on oeis.org

1, 4, 2, 9, 6, 16, 7, 12, 3, 26, 14, 20, 25, 8, 13, 38, 22, 31, 36, 15, 61, 21, 54, 33, 17, 45, 51, 24, 81, 32, 41, 73, 5, 48, 27, 62, 119, 69, 35, 105, 46, 57, 47, 96, 10, 65, 39, 82, 83, 151, 115, 92, 50, 135, 63, 76, 64, 124, 18, 86, 55, 106, 23, 108, 189, 146, 43, 118, 193, 68, 169, 84, 91, 100, 149, 85, 156, 28, 179, 111, 74, 136, 34

Offset: 1

Antti Karttunen, May 06 2015

nonn

Antti Karttunen, Table of n, a(n) for n = 1..10000
Index entries for sequences that are permutations of the natural numbers

Inverse: A257733.
Cf. A000959, A050505, A003309, A109497, A145649, A192607.
Related or similar permutations: A237126, A255421, A257725, A257732.
Cf. also A256486, A256487.

a(1) = 1; for n > 1: if A145649(n) = 1 [i.e., if n is lucky], then a(n) = A003309(1+a(A109497(n)-1)), otherwise a(n) = A192607(a(n-A109497(n))).
As a composition of other permutations:
a(n) = A255421(A257732(n)).
a(n) = A237126(A257725(n)).

cp's OEIS Frontend

A003309 Ludic numbers: apply the same sieve as Eratosthenes, but cross off every k-th remaining number.

Views

Author

Keywords

Comments

References

Links

Crossrefs

Programs

Haskell

Maple

Mathematica

PARI

PARI

PARI

Python

Python

Scheme

Formula

Extensions

A269171 Permutation of natural numbers: a(1) = 1, a(2n) = 2*a(n), a(2n+1) = A269379(a(A268674(2n+1))).

Views

Author

Keywords

Links

Crossrefs

Formula

A255422 Permutation of natural numbers: a(1) = 1 and for n > 1, if n is k-th ludic number larger than 1 [i.e., n = A003309(k+1)], a(n) = nthprime(a(k)), otherwise, when n is k-th nonludic number [i.e., n = A192607(k)], a(n) = nthcomposite(a(k)), where nthcomposite = A002808, nthprime = A000040.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Formula

A257731 Permutation of natural numbers: a(1) = 1, a(prime(n)) = lucky(1+a(n)), a(composite(n)) = unlucky(a(n)), where prime(n) = n-th prime number A000040, composite(n) = n-th composite number A002808 and lucky = A000959, unlucky = A050505.

Views

Author

Keywords

Links

Crossrefs

Formula

A255324 Difference between the n-th Ludic number and the n-th noncomposite number: a(n) = A003309(n) - A008578(n).

Views

Author

Keywords

Links

Crossrefs

Programs

Mathematica

Scheme

Formula

A257734 Permutation of natural numbers: a(1) = 1, a(lucky(n)) = ludic(1+a(n-1)), a(unlucky(n)) = nonludic(a(n)), where lucky(n) = n-th lucky number A000959, unlucky(n) = n-th unlucky number A050505, and ludic = A003309, nonludic = A192607.

Views

Author

Keywords

Links

Crossrefs

Formula

A255420 Ludic recurrence: Iterates of f(n) = A003309(n+1) starting from n=1.

Views

Author

Keywords

Links

Crossrefs

Programs

Haskell

Formula