%I A161557
%S A161557 1,744,393768,64481280,3457199880,101229281280,1999215843600,
%T A161557 29764163100672
%N A161557 a(n) = (n+1)*A000521(n), n>(-1)
%C A161557 [Mathworld]: "Lehmer(1942) showed that (n+1)*C(n) == 0 mod 24 for n=/
               > 1" Cf. A161395: (0, 31, 16407, 2686720, 144049995,...) = ((n+1)*A000521(n)) 
               / 24
%F A161557 a(n) = (n+1)*A000521(n), n>(-1)
%e A161557 a(2) = 64481280 = 3*A000521(2) = 3*21493760; such that 64481280 == 0 
               mod 24, where 64481280 / 24 = 2686720 = A161395(2)
%Y A161557 Cf. A000521, A161395
%Y A161557 Sequence in context: A119595 A000521 A066395 this_sequence A091406 A066396 
               A099819
%Y A161557 Adjacent sequences: A161554 A161555 A161556 this_sequence A161558 A161559 
               A161560
%K A161557 nonn
%O A161557 -1,2
%A A161557 Gary W. Adamson & Alexander Povolotsky (qntmpkt(AT)yahoo.com), Jun 13 
               2009