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.

A277820 Square array: A(r,1) = A065621(r); for c > 1, A(r,c) = A048724(A(r,c-1)), read by descending antidiagonals as A(1,1), A(1,2), A(2,1), A(1,3), A(2,2), A(3,1), etc.

Original entry on oeis.org

1, 3, 2, 5, 6, 7, 15, 10, 9, 4, 17, 30, 27, 12, 13, 51, 34, 45, 20, 23, 14, 85, 102, 119, 60, 57, 18, 11, 255, 170, 153, 68, 75, 54, 29, 8, 257, 510, 427, 204, 221, 90, 39, 24, 25, 771, 514, 765, 340, 359, 238, 105, 40, 43, 26, 1285, 1542, 1799, 1020, 937, 306, 187, 120, 125, 46, 31, 3855, 2570, 2313, 1028, 1275, 854, 461, 136, 135, 114, 33, 28
Offset: 1

Views

Author

Antti Karttunen, Nov 01 2016

Keywords

Comments

For all n >= 1, A277818 (= A268389(n)+1) gives the (one-based) index of the column where n is located in this array, while A268671(n) gives the (one-based) index of the row where it is on.
This array is obtained when one selects from A277320 the columns 1, 3, 5, 15, 17, 51, ..., i.e., those with an index A001317(k).

Examples

			The top left corner of the array:
   1,  3,   5,  15,  17,   51,   85,  255,   257,   771,  1285,  3855
   2,  6,  10,  30,  34,  102,  170,  510,   514,  1542,  2570,  7710
   7,  9,  27,  45, 119,  153,  427,  765,  1799,  2313,  6939, 11565
   4, 12,  20,  60,  68,  204,  340, 1020,  1028,  3084,  5140, 15420
  13, 23,  57,  75, 221,  359,  937, 1275,  3341,  5911, 14649, 19275
  14, 18,  54,  90, 238,  306,  854, 1530,  3598,  4626, 13878, 23130
  11, 29,  39, 105, 187,  461,  599, 1785,  2827,  7453, 10023, 26985
   8, 24,  40, 120, 136,  408,  680, 2040,  2056,  6168, 10280, 30840
  25, 43, 125, 135, 393,  667, 1965, 2295,  6425, 11051, 32125, 34695
  26, 46, 114, 150, 442,  718, 1874, 2550,  6682, 11822, 29298, 38550
  31, 33,  99, 165, 495,  561, 1619, 2805,  7967,  8481, 25443, 42405
  28, 36, 108, 180, 476,  612, 1708, 3060,  7196,  9252, 27756, 46260
  21, 63,  65, 195, 325,  975, 1105, 3315,  5397, 16191, 16705, 50115
  22, 58,  78, 210, 374,  922, 1198, 3570,  5654, 14906, 20046, 53970
  19, 53,  95, 225, 291,  869, 1455, 3825,  4883, 13621, 24415, 57825
  16, 48,  80, 240, 272,  816, 1360, 4080,  4112, 12336, 20560, 61680
  49, 83, 245, 287, 801, 1379, 4005, 4335, 12593, 21331, 62965, 73247
  50, 86, 250, 270, 786, 1334, 3930, 4590, 12850, 22102, 64250, 69390
  55, 89, 235, 317, 839, 1481, 3675, 4845, 14135, 22873, 60395, 80957

Links

Crossrefs

Inverse permutation: A277821.
Transpose: A277819.
Cf. A048724, A065621.
Row 1: A001317.
Column 1: A065621, column 2: A277823, column 3: A277825.
Cf. A268389, A277818, A268671.
Cf. also A193231, A277320, A277810, A276618 (A099884), A248513.
Other related tables or permutations: A277880, A277901.

Programs

Formula

A(r,1) = A065621(r); for c > 1, A(r,c) = A048724(A(r,c-1)).
A(r,c) = A048675(A277810(r,c)).
As a composition of other permutations:
a(n) = A277901(A277880(n)).

A277822 a(n) = index of the column where n is located in array A277880.

Original entry on oeis.org

0, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5, 1, 1, 2, 1, 2, 3, 1, 6, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 7, 1, 1, 2, 1, 2, 3, 1, 1, 2, 3, 1, 4, 1, 1, 2, 1, 2, 3, 1, 4, 1, 1, 2, 5
Offset: 0

Views

Author

Antti Karttunen, Nov 03 2016

Keywords

Comments

Ordinal transform of A277813.
a(n) = 1 + the number of iterations of map k -> A003188(A006068(k)/2) that are required (when starting from k = n) until k is an odious number.

Links

Crossrefs

One more than A277808.
Cf. A000069, A001969, A001511, A003188, A006068, A010059, A010060, A245710, A277813, A277818, A277880.

Formula

a(0) = 0, for n >= 1, a(n) = 1 + (A010059(n)*A001511(n)).
a(0) = 0, for n >= 1, if A010060(n) = 1 [when n is one of the odious numbers, A000069], then a(n) = 1, otherwise a(n) = 1 + a(A003188(A006068(n)/2)).
Other identities. For all n >= 1:
a(n) = 1 + a(floor(n/2)) when A010060(n) = 0.
a(n) = 1+A277808(n).

A366263 Doudna sequence permuted by Blue code: a(n) = A005940(1+A193231(n)).

Original entry on oeis.org

1, 2, 4, 3, 6, 5, 9, 8, 16, 27, 25, 18, 15, 12, 10, 7, 14, 11, 21, 20, 35, 30, 24, 45, 81, 32, 54, 125, 36, 75, 49, 50, 100, 147, 121, 98, 225, 72, 150, 245, 625, 162, 64, 243, 250, 343, 375, 108, 33, 28, 22, 13, 40, 63, 55, 42, 90, 175, 135, 48, 77, 70, 60, 105, 210, 385, 315, 120, 143, 154, 140, 231, 525, 180
Offset: 0

Views

Author

Antti Karttunen, Oct 06 2023

Keywords

Links

Crossrefs

Cf. A005940, A193231, A234022, A268389, A277818, A286601, A286602, A332450, A366264 (inverse map).
Cf. also A365810, A366260, A366275.

Programs

  • PARI
    A005940(n) = { my(p=2, t=1); n--; until(!n\=2, if((n%2), (t*=p), p=nextprime(p+1))); t };
A193231(n) = { my(x='x); subst(lift(Mod(1, 2)*subst(Pol(binary(n), x), x, 1+x)), x, 2) };
A366263(n) = A005940(1+A193231(n));

Formula

a(n) = A332450(A005940(1+n)).
For all n >= 0, A001222(a(n)) = A234022(n) and A046523(a(n)) = A286601(n).
For all n >= 1, A055396(a(n)) = A277818(n) = 1+A268389(n).

A277821 Inverse permutation to A277820.

Original entry on oeis.org

1, 3, 2, 10, 4, 5, 6, 36, 9, 8, 28, 14, 15, 21, 7, 136, 11, 27, 120, 19, 91, 105, 20, 44, 45, 55, 13, 78, 35, 12, 66, 528, 77, 17, 496, 90, 435, 465, 43, 53, 325, 351, 54, 406, 18, 65, 378, 152, 153, 171, 16, 210, 135, 34, 190, 300, 26, 119, 276, 25, 231, 253, 104, 2080, 118, 275, 2016, 32, 1891, 1953, 252, 324, 1653, 1711, 33
Offset: 1

Views

Author

Antti Karttunen, Nov 03 2016

Keywords

Links

Crossrefs

Inverse: A277820.
Cf. A268671, A277818.

Programs

  • Scheme
    (define (A277821 n) (let ((row (A268671 n)) (col (A277818 n))) (* (/ 1 2) (- (expt (+ row col) 2) row col col col -2))))

Formula

a(n) = (1/2) * ((c+r)^2 - r - 3*c + 2), where c = A277818(n), and r = A268671(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.