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!)
A076929 a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1. 1

%I #8 Jan 09 2016 17:36:29

%S 1,1,1,2,2,6,6,24,72,360,360,2160,2160,15120,75600,604800,604800,

%T 5443200,5443200,54432000,381024000,4191264000,4191264000,50295168000,

%U 251475840000,3269185920000,29422673280000,411917425920000

%N a(1) = 1, a(n+1)= a(n)*(n+1) divided by the smallest prime divisor of n+1.

%p a[1] := 1: for n from 2 to 100 do a[n] := n*a[n-1]/ifactors(n)[2][1][1]: od:seq(a[j],j=1..100);

%t nxt[{n_,a_}]:={n+1,(a(n+1))/FactorInteger[n+1][[1,1]]}; Transpose[ NestList[ nxt,{1,1},30]][[2]] (* _Harvey P. Dale_, Jan 09 2016 *)

%Y Cf. A076928.

%K nonn

%O 1,4

%A _Amarnath Murthy_, Oct 18 2002

%E More terms from _Sascha Kurz_, Jan 21 2003

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 March 29 10:58 EDT 2024. Contains 371268 sequences. (Running on oeis4.)