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.

A277880 Dispersion of evil numbers: Square array A(r,c) with A(r,1) = A000069(r); and for c > 1, A(r,c) = A001969(1+(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.

This page as a plain text file.
%I A277880 #11 Nov 05 2016 07:26:40
%S A277880 1,3,2,6,5,4,12,10,9,7,24,20,18,15,8,48,40,36,30,17,11,96,80,72,60,34,
%T A277880 23,13,192,160,144,120,68,46,27,14,384,320,288,240,136,92,54,29,16,
%U A277880 768,640,576,480,272,184,108,58,33,19,1536,1280,1152,960,544,368,216,116,66,39,21,3072,2560,2304,1920,1088,736,432,232,132,78,43,22
%N A277880 Dispersion of evil numbers: Square array A(r,c) with A(r,1) = A000069(r); and for c > 1, A(r,c) = A001969(1+(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.
%H A277880 Antti Karttunen, <a href="/A277880/b277880.txt">Table of n, a(n) for n = 1..7260; the first 120 antidiagonals of array</a>
%H A277880 <a href="/index/Bi#binary">Index entries for sequences related to binary expansion of n</a>
%H A277880 <a href="/index/Per#IntegerPermutation">Index entries for sequences that are permutations of the natural numbers</a>
%F A277880 A(r,1) = A000069(r) and for c > 1, A(r,c) = A001969(1+(A(r,c-1))).
%F A277880 Alternatively, if we set also the second column explicitly as:
%F A277880    A(r,2) = A129771(r) = 1+ 2*A000069(r),
%F A277880 then the rest of entries in each row are obtained just by doubling the preceding term on the same row: A(r,c) = 2*A(r,c-1), for c >= 3.
%F A277880 As a composition of other permutations:
%F A277880 a(n) = A277902(A277820(n)).
%e A277880 The top left 12 x 12 corner of the array:
%e A277880    1,  3,  6,  12,  24,  48,   96,  192,  384,   768,  1536,  3072
%e A277880    2,  5, 10,  20,  40,  80,  160,  320,  640,  1280,  2560,  5120
%e A277880    4,  9, 18,  36,  72, 144,  288,  576, 1152,  2304,  4608,  9216
%e A277880    7, 15, 30,  60, 120, 240,  480,  960, 1920,  3840,  7680, 15360
%e A277880    8, 17, 34,  68, 136, 272,  544, 1088, 2176,  4352,  8704, 17408
%e A277880   11, 23, 46,  92, 184, 368,  736, 1472, 2944,  5888, 11776, 23552
%e A277880   13, 27, 54, 108, 216, 432,  864, 1728, 3456,  6912, 13824, 27648
%e A277880   14, 29, 58, 116, 232, 464,  928, 1856, 3712,  7424, 14848, 29696
%e A277880   16, 33, 66, 132, 264, 528, 1056, 2112, 4224,  8448, 16896, 33792
%e A277880   19, 39, 78, 156, 312, 624, 1248, 2496, 4992,  9984, 19968, 39936
%e A277880   21, 43, 86, 172, 344, 688, 1376, 2752, 5504, 11008, 22016, 44032
%e A277880   22, 45, 90, 180, 360, 720, 1440, 2880, 5760, 11520, 23040, 46080
%o A277880 (Scheme)
%o A277880 (define (A277880 n) (A277880bi (A002260 n) (A004736 n)))
%o A277880 (define (A277880bi row col) (if (= 1 col) (A000069 row) (A001969 (+ 1 (A277880bi row (- col 1))))))
%o A277880 ;; Alternatively:
%o A277880 (define (A277880bi row col) (cond ((= 1 col) (A000069 row)) ((= 2 col) (A129771 row)) (else (* 2 (A277880bi row (- col 1))))))
%o A277880 (define (A129771 n) (+ 1 (* 2 (A000069 n))))
%Y A277880 Inverse permutation: A277881.
%Y A277880 Transpose: A277882.
%Y A277880 Column 1: A000069, column 2: A129771.
%Y A277880 Row 1: A003945.
%Y A277880 Cf. A277813 (index of the row where n is located in this array), A277822 (index of the column).
%Y A277880 Cf. A001969.
%Y A277880 Other related tables or permutations: A277820, A277902, A248513.
%K A277880 nonn,tabl,base
%O A277880 1,2
%A A277880 _Antti Karttunen_, Nov 03 2016