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!)
A026458 a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<j<=n. 2

%I #13 Mar 06 2016 10:22:23

%S 3,4,5,6,7,8,9,11,12,14,15,17,20,21,23,24,27,29,32,35,36,37,39,41,44,

%T 45,47,48,50,51,55,56,57,59,60,62,63,65,69,71,72,74,76,77,80,81,84,87,

%U 89,91,92,93,95,99,101,102,104,105,107,108

%N a(n) = least positive integer > a(n-1) and not a(i)*a(j)-2 for 1<=i<j<=n.

%H Ivan Neretin, <a href="/A026458/b026458.txt">Table of n, a(n) for n = 1..1000</a>

%t a = {3, 4}; used = {a[[1]]*a[[2]] - 2}; Do[k = a[[-1]] + 1; While[MemberQ[used, k], k++]; used = Union[used, k*a - 2]; AppendTo[a, k], {n, 3, 60}]; a (* _Ivan Neretin_, Mar 06 2016 *)

%Y Cf. A026453 and references therein.

%K nonn

%O 1,1

%A _Clark Kimberling_

%E Definition corrected by _Harvey P. Dale_, Oct 16 2014

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 May 5 17:32 EDT 2024. Contains 372277 sequences. (Running on oeis4.)