The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A080793 Starting with a(0)=1, smallest number k>a(n-1) such that, for all a(m) with m

%I

%S 1,3,15,17,147,233,577,735,3615,4335,8117,9505,10947,14403,25215,

%T 30833,128773,220647,251173,522003,617547,770977,926117,967335,

%U 1455533,1662533,1960215,2389517,2469747,3528147,4674747,5556747,5730135

%N Starting with a(0)=1, smallest number k>a(n-1) such that, for all a(m) with m<n, k+a(m) is not squarefree.

%o (PARI) v=vector(60); v[1]=1; print1("1, "); for(n=2, 60, for(k=v[n-1]+1, 10^15, s=0; for(l=1, n-1, if(issquarefree(k+v[l]), break); s=s+1); if(s==n-1, print1(k", "); v[n]=k; break)))

%Y Cf. A077225.

%K nonn

%O 0,2

%A _Ralf Stephan_, Mar 25 2003

%E More terms from Lambert Klasen (Lambert.Klasen(AT)gmx.net) and lambert.herrgesell(AT)aschendorff.de, Jul 26 2005

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

Last modified September 22 19:36 EDT 2021. Contains 347608 sequences. (Running on oeis4.)