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!)
A069753 Smallest k>n such that the tetrahedral number n*(n+1)*(n+2)/6 divides the tetrahedral number k*(k+1)*(k+2)/6. 0

%I #9 Nov 21 2013 12:47:46

%S 2,4,4,8,13,14,26,54,43,20,64,26,63,48,118,270,151,170,55,54,229,207,

%T 274,350,323,350,376,174,433,928,494,1054,119,440,259,664,701,208,778,

%U 328,859,516,944,504,1033,2160,1126,2350,1223,1274,1324,1376,1429,350

%N Smallest k>n such that the tetrahedral number n*(n+1)*(n+2)/6 divides the tetrahedral number k*(k+1)*(k+2)/6.

%t stn[n_]:=Module[{i=n+1,tn=(n(n+1)(n+2))/6},While[!Divisible[(i(i+1) (i+2))/6,tn],i++];i]; stn/@Range[70] (* _Harvey P. Dale_, Apr 11 2011 *)

%o (PARI) for(s=1,80,n=s+1; while(frac(n*(n+1)*(n+2)/(s*(s+1)*(s+2)))>0,n++); print1(n,","); )

%K easy,nonn

%O 1,1

%A _Benoit Cloitre_, May 01 2002

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 28 08:19 EDT 2024. Contains 371236 sequences. (Running on oeis4.)