A266194 Products of pairs made by match-making permutation: a(n) = A266195(n) * A266195(n+1).

2, 6, 12, 20, 30, 48, 56, 63, 90, 120, 192, 176, 187, 221, 416, 448, 252, 360, 380, 627, 495, 510, 748, 1408, 1344, 504, 864, 1008, 1820, 1495, 1518, 1650, 1000, 1400, 2520, 3024, 2016, 1776, 2516, 1768, 3328, 3456, 3483, 3741, 3770, 3900, 3960, 4092, 7936, 9728, 3040, 3920, 3577, 4088, 7616, 5576, 3936, 6624, 9936, 9648, 5628, 8148, 13289

Offset

1,1

Links

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

Formula

a(n) = A266195(n) * A266195(n+1).

a(n) = A048720(A266195(n), A266195(n+1)).

a(n) = A057889(A057889(A266195(n)) * A057889(A266195(n+1))). [See the comment in A266351.]

Prog

(Scheme, two variants)
(define (A266194 n) (* (A266195 n) (A266195 (+ n 1))))
(define (A266194 n) (A048720bi (A266195 n) (A266195 (+ n 1)))) ;; A048720bi implements the carryless binary multiplication, specified in A048720.

Crossrefs

Cf. A048720, A057889, A266195, A266351.

Sequence in context: A002378 A349704 A005991 * A194110 A291876 A277365

Adjacent sequences: A266191 A266192 A266193 * A266195 A266196 A266197

Keyword

nonn,base

Author

Antti Karttunen, Dec 26 2015

Status

approved