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.
%I A161671 #31 Jul 09 2025 04:30:41 %S A161671 2,2,1,1,3,4,7,7,9,14,15,19,21,22,25,29,34,35,40,43,43,47,50,55,62,65, %T A161671 65,68,69,71,83,86,91,91,100,101,106,111,113,118,123,124,133,133,135, %U A161671 136,147,158,161,161,164,169,169,177,182,187,192,193,197,200,201,209 %N A161671 a(n) = prime(n) - A141468(n). %H A161671 Michael De Vlieger, <a href="/A161671/b161671.txt">Table of n, a(n) for n = 1..10000</a> %H A161671 Michael De Vlieger, <a href="/A161671/a161671.png">Scatterplot of a(n)</a>, n = 1..120, showing and labeling primes p (in A214627) in red and blue, the red primes are duplicated and are listed in A220220. We plot in green duplicated composite terms. %F A161671 a(n) = A000040(n) - A141468(n). %F A161671 a(n+2) = A168563(n). %F A161671 a(n) = A000040(n) - A018252(n-1), if n >= 2. - _Omar E. Pol_, Oct 21 2011 %F A161671 a(n) ~ n log n. - _Charles R Greathouse IV_, Dec 21 2011 %e A161671 2(=2-0), 2(=3-1), 1(=5-4), 1(=7-6), 3(=11-8), 4(=13-9), 7(=17-10), 7(=19-12), 9(=23-14), 14(=29-15), etc. %p A161671 A161671 := proc(n) %p A161671 ithprime(n)-A141468(n) ; %p A161671 end proc: # _R. J. Mathar_, Aug 08 2012 %t A161671 f[n_] := FixedPoint[n + PrimePi@ # &, n + PrimePi@ n]; Array[Prime[#] - f[# - 1] &, 62] (* _Michael De Vlieger_, Mar 22 2022, after _Robert G. Wilson v_ at A141468 *) %Y A161671 Cf. A000040, A002808, A141468, A141559, A168563, A214627, A220220. %K A161671 nonn %O A161671 1,1 %A A161671 _Juri-Stepan Gerasimov_, Jun 16 2009, Dec 03 2009 %E A161671 Edited by _N. J. A. Sloane_, Jun 30 2009 %E A161671 207 replaced with 209 by _R. J. Mathar_, Oct 04 2009 %E A161671 Edited by _Omar E. Pol_, Oct 21 2011