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!)
A082607 a(0)=1; for n > 0, a(n) = least k not included earlier such that k*a(n-1) - 1 is a square. 3

%I #10 Nov 18 2018 00:24:49

%S 1,2,5,10,17,26,37,50,65,34,13,25,41,61,85,113,145,122,101,82,293,634,

%T 1105,53,109,185,74,149,250,377,205,146,97,58,29,73,137,221,181,650,

%U 541,442,353,274,953,2042,3541,5450,409,173,370,289,218,157,106,337,698

%N a(0)=1; for n > 0, a(n) = least k not included earlier such that k*a(n-1) - 1 is a square.

%t l = {1}; Do[k = 1; While[MemberQ[l, k] || !IntegerQ[Sqrt[k*Last[l]-1]], k++ ]; AppendTo[l, k], {n, 50}]; l (* _Ryan Propper_, Jun 13 2006 *)

%o (PARI) a=[1];print1(1",");for(n=2,100,k=1;f=1;while(f,if(issquare(k*a[n-1]-1),f=0;for(i=1,n-1,if(a[i]==k,f=1)));k++);a=concat(a,k-1);print1(k-1",")) \\ Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2007

%Y Cf. A082608, A082609, A082610, A082611, A082612.

%K nonn

%O 0,2

%A _Amarnath Murthy_, Apr 28 2003

%E Corrected and extended by _Ryan Propper_, Jun 13 2006

%E Definition corrected by _R. J. Mathar_, Nov 12 2006

%E More terms from Herman Jamke (hermanjamke(AT)fastmail.fm), May 01 2007

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 April 23 13:51 EDT 2024. Contains 371914 sequences. (Running on oeis4.)