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.

A144370 Shifts 6 places left under Dirichlet convolution.

This page as a plain text file.
%I A144370 #9 May 09 2019 22:03:26
%S A144370 1,1,1,1,1,1,1,2,2,3,2,4,2,6,5,8,4,12,4,14,12,21,8,30,8,36,26,46,16,
%T A144370 74,17,76,56,106,32,166,34,172,116,220,66,369,68,352,236,478,132,776,
%U A144370 136,750,486,972,264,1640,273,1522,980,2020,528,3360,550,3152,1968,4072
%N A144370 Shifts 6 places left under Dirichlet convolution.
%H A144370 Alois P. Heinz, <a href="/A144370/b144370.txt">Table of n, a(n) for n = 1..1000</a>
%H A144370 N. J. A. Sloane, <a href="/transforms.txt">Transforms</a>
%F A144370 G.f.: x + x^2 + x^3 + x^4 + x^5 + x^6 * (1 + Sum_{i>=1} Sum_{j>=1} a(i)*a(j)*x^(i*j)). - _Ilya Gutkovskiy_, May 09 2019
%p A144370 k:= 6: with (numtheory): dck:= proc(b,c) proc(n, k) option remember; add (b(d,k) *c(n/d,k), d=`if`(n<0,{}, divisors(n))) end end: B:= dck(T,T): T:= (n, k)-> if n<=k then 1 else B(n-k, k) fi: a:= n-> T(n,k): seq (a(n), n=1..70);
%Y A144370 6th column of A144374. Cf. A000005.
%K A144370 eigen,nonn
%O A144370 1,8
%A A144370 _Alois P. Heinz_, Sep 18 2008