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

A207800 Permutation of positive numbers. See comments.

Original entry on oeis.org

1, 2, 3, 4, 7, 8, 5, 16, 15, 32, 6, 64, 11, 128, 9, 256, 31, 512, 10, 1024, 13, 2048, 12, 4096, 23, 8192, 17, 16384, 14, 32768, 18, 65536, 63, 131072, 20, 262144, 19, 524288, 24, 1048576, 27, 2097152, 33, 4194304, 21, 8388608, 34, 16777216, 47, 33554432, 36, 67108864, 22, 134217728, 40
Offset: 1

Views

Author

Keywords

Comments

a(1)=1; on places 2,4,6,8,... we put 2^m, m=1,2,3,..., i.e., numbers n with A000120(n)=1; on places 3,7,11,15,... we put numbers n with A000120(n)=2; on places 5,13,21,29,... we put numbers n with A000120(n)=3; etc.
For general description of the order, see comment in A207790.

Crossrefs

Cf. A207790.

Formula

a(n) = A066884(A209268(A065190(n))). Equivalently, a(n) = A067576(A249725(A065190(n))). - Ivan Neretin, Apr 30 2016

Extensions

a(30) corrected by Ivan Neretin, Apr 30 2016

A207801 Permutation of positive numbers. See comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 6, 9, 8, 7, 10, 15, 12, 25, 14, 21, 16, 11, 18, 27, 20, 35, 22, 33, 24, 49, 26, 39, 28, 55, 30, 45, 32, 13, 34, 51, 36, 65, 38, 57, 40, 77, 42, 63, 44, 85, 46, 69, 48, 121, 50, 75, 52, 95, 54, 81, 56, 91, 58, 87, 60, 115, 62, 93, 64, 17, 66, 99, 68, 125, 70, 105, 72, 119, 74
Offset: 1

Views

Author

Keywords

Comments

a(1)=1; on places 2,4,6,8,... we put the same numbers, i.e., numbers with the least prime divisor p_1=2; on places 3,7,11,15,... we put numbers with the least prime divisor p_2=3; on places 5,13,21,29,... we put numbers with the least prime divisor p_3=5; etc.
For general description of the order, see comment in A207790.

Crossrefs

Programs

  • Mathematica
    a = Array[1 &, mx = 74]; cnt = mx - 1; offs = Table[2^(i - 1) + 1, {i, 1, mx}]; n = 1; While[cnt > 0, n++; idx = PrimePi[FactorInteger[n][[1, 1]]]; pos = offs[[idx]]; If[pos > mx, Continue[]]; offs[[idx]] += 2^idx; a[[pos]] = n; cnt--]; a (* Ivan Neretin, May 06 2015 *)

Formula

For n>1, a(n) = A083140(1+A209268(n-1)). Equivalently, a(n) = A083221(1+A249725(n-1)). - Ivan Neretin, Apr 30 2016

A207802 Permutation of positive numbers. See comments.

Original entry on oeis.org

1, 2, 3, 4, 5, 8, 6, 16, 7, 32, 9, 64, 10, 128, 12, 256, 11, 512, 18, 1024, 15, 2048, 24, 4096, 14, 8192, 27, 16384, 20, 32768, 36, 65536, 13, 131072, 48, 262144, 25, 524288, 54, 1048576, 21, 2097152, 72, 4194304, 30, 8388608, 81, 16777216, 22, 33554432, 96, 67108864, 40, 134217728, 108
Offset: 1

Views

Author

Keywords

Comments

a(1)=1; on places 2,4,6,8,... we put 2^m, m=1,2,3,..., i.e., numbers with the greatest prime divisor p_1=2; on places 3,7,11,15,... we put numbers with the greatest prime divisor p_2=3; on places 5,13,21,29,... we put numbers with the greatest prime divisor p_3=5; etc.
For general description of the order, see the comment in A207790.

Crossrefs

Formula

For n>1, a(n) = A125624(A209268(n-1)). - Ivan Neretin, Apr 30 2016

Extensions

a(30) fixed by Ivan Neretin, Apr 30 2016
Showing 1-3 of 3 results.