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!)
A173381 a(n) = b_n(p_(n+1)) where p_n is the n-th prime, b_n(1)=1, b_n(2)=p_n, and for k>=3, b_n(k) is the smallest number larger than b_n(k-1) such that, for all i<k, b_n(k) is relatively prime to b_n(i) iff k is relatively prime to i. 0
3, 11, 31, 163, 661, 929, 2041, 21341, 15989, 47387, 125117, 263411, 123493, 10426601, 3654221, 4167127, 86622397, 4036267, 3910993, 541513877 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,1
LINKS
MAPLE
b:= proc(n, k) option remember; local ok, m, i;
if k=1 then 1
elif k=2 then ithprime(n)
else for m from b(n, k-1)+1 do
ok:= true;
for i from 1 to k-1 do
if igcd(k, i)=1 xor igcd(m, b(n, i))=1
then ok:= false; break fi
od;
if ok then break fi
od; m
fi
end:
a:= n-> b(n, ithprime(n+1));
seq(a(n), n=1..10); # Alois P. Heinz, Nov 22 2010
MATHEMATICA
b[n_, k_] := b[n, k] = Module[{ok, m, i}, Which[k==1, 1, k==2, Prime[n], True, For[m = b[n, k - 1] + 1, True, m++, ok = True; For[i = 1, i <= k - 1, i++, If[Xor[GCD[k, i]==1, GCD[m, b[n, i]]==1], ok = False; Break[]]]; If[ok, Break[]]]; m]];
a[n_] := b[n, Prime[n + 1]];
Array[a, 10] (* Jean-François Alcover, Nov 28 2020, after Alois P. Heinz *)
CROSSREFS
Sequence in context: A146456 A095692 A163421 * A076477 A319335 A104079
KEYWORD
nonn
AUTHOR
Vladimir Shevelev, Nov 22 2010
EXTENSIONS
More terms from Alois P. Heinz, Nov 22 2010
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 March 28 16:58 EDT 2024. Contains 371254 sequences. (Running on oeis4.)