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.

A166628 Totally multiplicative sequence with a(p) = 7p for prime p.

This page as a plain text file.
%I A166628 #12 Oct 30 2019 10:54:25
%S A166628 1,14,21,196,35,294,49,2744,441,490,77,4116,91,686,735,38416,119,6174,
%T A166628 133,6860,1029,1078,161,57624,1225,1274,9261,9604,203,10290,217,
%U A166628 537824,1617,1666,1715,86436,259,1862,1911,96040,287,14406,301,15092,15435
%N A166628 Totally multiplicative sequence with a(p) = 7p for prime p.
%H A166628 G. C. Greubel, <a href="/A166628/b166628.txt">Table of n, a(n) for n = 1..10000</a>
%F A166628 Multiplicative with a(p^e) = (7p)^e.
%F A166628 If n = Product p(k)^e(k) then a(n) = Product (7*p(k))^e(k).
%F A166628 a(n) = n * A165828(n) = n * 7^bigomega(n) = n * 7^A001222(n).
%F A166628 Dirichlet g.f.: Product_{p prime} 1 / (1 - 7 * p^(1 - s)). - _Ilya Gutkovskiy_, Oct 30 2019
%t A166628 Table[n*7^PrimeOmega[n], {n, 1, 100}] (* _G. C. Greubel_, May 19 2016 *)
%Y A166628 Cf. A001222, A165828.
%K A166628 nonn,mult
%O A166628 1,2
%A A166628 _Jaroslav Krizek_, Oct 18 2009