A077580 Duplicate of A069213.
1, 3, 4, 7, 6, 17, 8, 15, 13, 23, 12, 35, 14, 31, 28, 31, 18, 53, 20, 49, 37, 47, 24, 71, 31
Offset: 1
This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.
1; 1, 3; 1, 2, 4; 1, 3, 5, 7; 1, 2, 3, 4, 6; 1, 5, 7, 11, 13, 17; 1, 2, 3, 4, 5, 6, 8; 1, 3, 5, 7, 9, ...
a077581 n k = a077581_tabl !! (n-1) !! (k-1) a077581_row n = a077581_tabl !! (n-1) a077581_tabl = map (\x -> take x [z | z <- [1..], gcd x z == 1]) [1..] -- Reinhard Zumkeller, Sep 26 2014
row[n_] := Take[Select[Range[n^2], GCD[ #, n]==1&], n]; Join@@row/@Range[13]
a077582 = sum . a077581_row -- Reinhard Zumkeller, Sep 26 2014
a247815 = sum . map a010051' . a077581_row
Join[{1},Table[Select[Range[5000],!CoprimeQ[#,n]&][[n]],{n,2,60}]] (* Harvey P. Dale, May 26 2023 *)
a(n) = local(i, k); if(n<=1,n,k=n-eulerphi(n);i=n\k;k*=i;i*=n; while(k
a077665 = last . a077664_row -- Reinhard Zumkeller, Aug 03 2015
a247798 n = a077581 (2 * n - 1) n
The positive integers which are coprime to 6 are 1,5,7,11,13,17,19,23,... The 5th of these is 13, which is a(5).
f[n_] := Block[{k = 0, c = n},While[c > 0,k++;While[GCD[k, n + 1] > 1, k++ ];c--;];k];Table[f[n], {n, 67}] (* Ray Chandler, Dec 29 2006 *)
The positive integers which are coprime to 6 are 1,5,7,11,13,17,19,23,... The 7th of these is 19, which is a(6).
f[n_] := Block[{k = 0, c = n + 1},While[c > 0,k++;While[GCD[k, n] > 1, k++ ];c--;];k];Table[f[n], {n, 67}] (* Ray Chandler, Dec 29 2006 *)
a(4) is the 4th positive integer coprime to 4 and not among the first 3 terms of the sequence (i.e. the 4th term among 3, 9, 11, 13, 15,...).
Comments