|
%I #8 Apr 05 2023 15:08:14
%S 1,4,7,16,19,28,31,64,49,76,79,112,115,124,133,256,259,196,199,304,
%T 217,316,319,448,361,460,343,496,499,532,535,1024,553,1036,589,784,
%U 787,796,805,1216,1219,868,871,1264,931,1276,1279,1792,961,1444
%N Totally multiplicative sequence with a(p) = a(p-1) + 3 for prime p.
%H Robert Israel, <a href="/A166700/b166700.txt">Table of n, a(n) for n = 1..10000</a>
%F Multiplicative with a(p^e) = (a(p-1)+3)^e. If n = Product p(k)^e(k) then a(n) = Product (a(p(k)-1)+3)^e(k).
%p f:= proc(n) option remember; local F,t;
%p F:= ifactors(n)[2];
%p mul((procname(t[1]-1)+3)^t[2],t = F)
%p end proc:
%p map(f, [$1..50]); # _Robert Israel_, Apr 05 2023
%K nonn,mult,look
%O 1,2
%A _Jaroslav Krizek_, Oct 18 2009
|
