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-6 of 6 results.

A246364 Permutation of natural numbers: a(n) = A064216(A227413(n)).

Original entry on oeis.org

1, 2, 5, 3, 7, 11, 13, 4, 6, 9, 19, 14, 8, 12, 29, 10, 17, 31, 23, 16, 41, 71, 37, 44, 47, 39, 43, 42, 38, 30, 26, 59, 22, 34, 15, 85, 53, 58, 25, 130, 57, 151, 61, 311, 103, 69, 33, 365, 157, 111, 73, 226, 74, 106, 67, 370, 223, 56, 97, 341, 139, 122, 35, 133, 55, 86, 20, 145, 46, 49, 21, 659, 118, 36, 83, 419, 127, 191, 18
Offset: 1

Views

Author

Antti Karttunen, Aug 26 2014

Keywords

Comments

After a(2) = 2, the rest of the even bisection contains only terms of A246261. However, some of the terms of A246261 are also found in the odd bisection, while terms of A246263, apart from 2, all reside in the odd bisection of this sequence.

Links

Crossrefs

Inverse: A246363.
Related or similar permutations: A064216, A227413, A246366, A246368.
Cf. A246261, A246263.

Programs

Formula

a(n) = A064216(A227413(n)).

A246367 Permutation of natural numbers: a(n) = A005940(A135141(n)).

Original entry on oeis.org

1, 2, 4, 3, 8, 5, 6, 7, 9, 11, 16, 15, 10, 25, 21, 27, 12, 33, 14, 13, 45, 35, 18, 75, 63, 81, 49, 99, 22, 55, 32, 39, 135, 105, 125, 225, 30, 189, 243, 147, 20, 297, 50, 65, 165, 17, 42, 117, 405, 315, 375, 675, 54, 175, 567, 729, 441, 77, 24, 891, 66, 245, 195, 495, 51, 275, 28, 351, 1215, 945, 26
Offset: 1

Views

Author

Antti Karttunen, Aug 26 2014

Keywords

Links

Crossrefs

Inverse: A246368.
Cf. A000035, A010051.
Related or similar permutations: A005940, A135141, A246363, A246365.

Programs

Formula

a(n) = A005940(A135141(n)).
Other identities:
For all n >= 1, A000035(a(n)) = 1 - A010051(n). [This permutation maps primes to even numbers and nonprimes to odd numbers, in some order, because permutation A135141 has the same property and A005940 preserves the parity].

A246380 Permutation of natural numbers: a(1) = 1, a(2n) = nthcomposite(a(n)), a(2n-1) = nthprime(a(A064989(2n-1)-1)), where nthprime = A000040, nthcomposite = A002808, and A064989(n) shifts the prime factorization of n one step towards smaller primes.

Original entry on oeis.org

1, 4, 2, 9, 7, 6, 23, 16, 3, 14, 13, 12, 43, 35, 17, 26, 37, 8, 101, 24, 5, 22, 19, 21, 53, 62, 83, 51, 79, 27, 233, 39, 191, 54, 149, 15, 103, 134, 11, 36, 47, 10, 151, 34, 41, 30, 29, 33, 73, 75, 241, 86, 113, 114, 89, 72, 1153, 108, 443, 40, 593, 296, 547, 56, 167, 245, 173, 76, 563, 194, 1553, 25
Offset: 1

Views

Author

Antti Karttunen, Aug 29 2014

Keywords

Comments

Has an infinite number of infinite cycles. See comments in A246379.

Links

Crossrefs

Inverse: A246379.
Similar or related permutations: A246376, A246378, A246363, A246364, A246366, A246368, A064216, A246682.
Cf. A000035, A000040, A002808, A010051, A064989.

Programs

  • PARI
    default(primelimit,(2^31)+(2^30));
A002808(n) = { my(k=-1); while( -n + n += -k + k=primepi(n), ); n }; \\ This function from M. F. Hasler
A064989(n) = {my(f); f = factor(n); if((n>1 && f[1,1]==2), f[1,2] = 0); for (i=1, #f~, f[i,1] = precprime(f[i,1]-1)); factorback(f)};
A246380(n) = if(1==n, 1, if(!(n%2), A002808(A246380(n/2)), prime(A246380(A064989(n)-1))));
for(n=1, 3098, write("b246380.txt", n, " ", A246380(n)));
(Scheme, with memoization-macro definec)
(definec (A246380 n) (cond ((< n 2) n) ((even? n) (A002808 (A246380 (/ n 2)))) (else (A000040 (A246380 (- (A064989 n) 1))))))

Formula

a(1) = 1, a(2n) = nthcomposite(a(n)), a(2n-1) = nthprime(a(A064989(2n-1)-1)), where nthprime = A000040, nthcomposite = A002808, and A064989(n) shifts the prime factorization of n one step towards smaller primes.
As a composition of related permutations:
a(n) = A246378(A246376(n)).
Other identities. For all n > 1 the following holds:
A010051(a(n)) = A000035(n). [Maps odd numbers larger than one to primes, and even numbers to composites, in some order. Permutations A246378 & A246682 have the same property].

A246682 Permutation of natural numbers: a(1) = 0, a(2) = 1, and for n > 1, a(2n) = nthcomposite(a(n)), a(2n-1) = nthprime(a(A064989(2n-1))), where nthprime = A000040, nthcomposite = A002808, and A064989(n) shifts the prime factorization of n one step towards smaller primes.

Original entry on oeis.org

0, 1, 2, 4, 3, 6, 5, 9, 7, 8, 11, 12, 31, 10, 13, 16, 127, 14, 709, 15, 19, 20, 5381, 21, 17, 46, 23, 18, 52711, 22, 648391, 26, 29, 166, 41, 24, 9737333, 858, 71, 25, 174440041, 30, 3657500101, 32, 37, 6186
Offset: 1

Views

Author

Antti Karttunen, Sep 01 2014

Keywords

Comments

Note the indexing: the domain starts from 1, while the range includes also zero.
Has an infinite number of infinite cycles. See comments at A246681.

Links

Crossrefs

Inverse: A246681.
Similar or related permutations: A246376, A246378, A243071, A246368, A064216, A246380.
Cf. A000035, A000040, A002808, A007097, A010051, A064989, A049076, A078442.

Programs

Formula

a(1) = 0, a(2) = 1, and for n > 1, a(2n) = nthcomposite(a(n)), a(2n-1) = nthprime(a(A064989(2n-1))), where nthprime = A000040, nthcomposite = A002808, and A064989(n) shifts the prime factorization of n one step towards smaller primes.
As a composition of related permutations:
a(n) = A246378(A243071(n)).
Other identities.
For all n >= 1 the following holds:
a(A000040(n)) = A007097(n-1). [Maps primes to the iterates of primes].
A049076(a(A000040(n))) = n. [Follows from above].
For all n > 1 the following holds:
A010051(a(n)) = A000035(n). [Maps odd numbers larger than one to primes, and even numbers to composites, in some order. Permutations A246378 & A246380 have the same property].

A246366 Permutation of natural numbers: a(n) = A005941(A227413(n)).

Original entry on oeis.org

1, 2, 4, 3, 6, 9, 7, 5, 8, 33, 12, 65, 18, 257, 16, 17, 10, 129, 11, 4097, 34, 2049, 19, 65537, 15, 8193, 24, 4194305, 21, 32769, 66, 1025, 20, 513, 14, 262145, 22, 16385, 13, 1099511627777, 1026, 2097153, 130, 68719476737, 30, 1048577, 35, 288230376151711745, 8194, 67108865, 40, 4398046511105, 2050, 8388609, 28
Offset: 1

Views

Author

Antti Karttunen, Aug 26 2014

Keywords

Comments

Maps even numbers to terms of A000051 (2^n + 1) in some order.

Links

Crossrefs

Inverse: A246365.
Related or similar permutations: A005941, A156552, A227413, A246364, A246368.
Cf. A000051.

Programs

Formula

a(n) = A005941(A227413(n)) = 1 + A156552(A227413(n)).

A320672 a(n) is the smallest divisor of (n+2)*(n+3) not yet in the sequence.

Original entry on oeis.org

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

Views

Author

Enrique Navarrete, Oct 19 2018

Keywords

Comments

a(n) is the smallest divisor of A002378(n+2) not yet in the sequence.
The numbers that are smaller than the preceding terms are: 3, 5, 9, 17, 33, 44, 55, 65, 90, 99, 143, 208, ...

Examples

			For n = 0, a(0) = 1 since 1 is the smallest divisor of 6 not yet in the sequence.
For n = 3, a(3) = 3 since 3 is the smallest divisor of 30 not yet in the sequence.

Crossrefs

Cf. A002378, A111273, A246368.

Programs

  • Mathematica
    s = {}; Do[d = Divisors[(n + 2)(n + 3)]; Do[d1 = d[[k]]; If[FreeQ[s, d1], AppendTo[s, d1]; Break[]], {k, Length[d]}], {n, 0, 100}]; s (* Amiram Eldar, Nov 14 2018 *)
  • PARI
    toadd(n, v) = {fordiv(n, d, if (!vecsearch(v, d), return(d)); ); }
lista(nn) = {v = []; for (n = 0, nn, newt = toadd((n+2)*(n+3), v); print1(newt, ", "); v = vecsort(concat(v, newt)); ); } \\ Michel Marcus, Nov 20 2018
Showing 1-6 of 6 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.