login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A309243 Completely multiplicative with a(p) = p * a(p-1) for any prime number p. 3

%I #16 Jul 20 2019 12:29:27

%S 1,2,6,4,20,12,84,8,36,40,440,24,312,168,120,16,272,72,1368,80,504,

%T 880,20240,48,400,624,216,336,9744,240,7440,32,2640,544,1680,144,5328,

%U 2736,1872,160,6560,1008,43344,1760,720,40480,1902560,96,7056,800,1632,1248

%N Completely multiplicative with a(p) = p * a(p-1) for any prime number p.

%C All terms are distinct and belong to A064522.

%H Rémy Sigrist, <a href="/A309243/b309243.txt">Table of n, a(n) for n = 1..10000</a>

%F a(n) >= n with equality iff n is a power of 2.

%F a(n) is a multiple of n.

%F a(n) is a multiple of A000010(n).

%F A006530(a(n)) = A006530(n).

%F A053585(a(n)) = A053585(n).

%F Apparently, A007814(a(n)) = A064415(n).

%e a(2) = 2 * a(1) = 2.

%e a(5) = 5 * a(4) = 5 * a(2)^2 = 5 * 2^2 = 20.

%o (PARI) a(n) = my (f=factor(n), p=f[,1]~, e=f[,2]~); prod (i=1, #p, (p[i] * a(p[i] - 1))^e[i])

%Y Cf. A000010, A006530, A053585, A064415, A064522.

%K nonn,mult

%O 1,2

%A _Rémy Sigrist_, Jul 17 2019

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified July 21 11:36 EDT 2024. Contains 374472 sequences. (Running on oeis4.)