The OEIS mourns the passing of Jim Simons and is grateful to the Simons Foundation for its support of research in many branches of science, including the OEIS.
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!)
A075832 Let u(1) = u(2) = u(3) = u(4) = 1, u(n+4)*(n+4) = u(n+3)*(n+3)+u(n+2)*(n+2)+u(n+1)*(n+1)+u(n)*n; sequence gives values of n such that u(n) is an integer. 0
1, 2, 3, 4, 5, 67, 150, 154, 387, 547, 813, 1034, 1710, 4994, 13582, 700427, 1598953, 2960411 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,2
COMMENTS
No more terms up to n=15*10^6. - Lambert Klasen (Lambert.Klasen(AT)gmx.net) and Robert G. Wilson v, Aug 05 2005
LINKS
MATHEMATICA
a = {0, 1, 1, 1, 1}; Do[a = Rest[ Join[a, {((n - 4)a[[2]] + (n - 3)a[[3]] + (n - 2)a[[4]] + (n - 1)a[[5]])/n}]]; If[ IntegerQ[ Last[ a]], Print[n]], {n, 5, 2*10^6}] (* Robert G. Wilson v *)
PROG
(PARI) v = [1, 1, 1, 1]; for(k=0, 15, s=k*10^6+1; e=(k+1)*10^6; if(s==1, s=5); print(s, " - ", e, ":"); for(n=s, e, v[(n-1)%4+1]=((n-4)*v[(n-1)%4+1]+(n-3)*v[(n)%4+1]+(n-2)*v[(n+1)%4+1]+(n-1)*v[(n+2)%4+1])/n; if(denominator(v[(n-1)%4+1])==1, print1(n, ", "))); print()) \\ (Klasen)
CROSSREFS
Cf. A075770.
Sequence in context: A004856 A325653 A037327 * A037434 A033170 A334536
KEYWORD
nonn
AUTHOR
Benoit Cloitre, Oct 14 2002
EXTENSIONS
Corrected and extended by Lambert Klasen (Lambert.Klasen(AT)gmx.net) and Robert G. Wilson v, Aug 05 2005
STATUS
approved

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 June 6 08:45 EDT 2024. Contains 373119 sequences. (Running on oeis4.)