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 A305900 #7 Jun 15 2018 09:26:30 %S A305900 1,2,3,4,5,6,5,7,8,9,5,10,5,11,12,13,5,14,5,15,16,17,5,18,19,20,21,22, %T A305900 5,23,5,24,25,26,27,28,5,29,30,31,5,32,5,33,34,35,5,36,37,38,39,40,5, %U A305900 41,42,43,44,45,5,46,5,47,48,49,50,51,5,52,53,54,5,55,5,56,57,58,59,60,5,61,62,63,5,64,65,66,67,68,5,69,70,71,72,73,74,75,5,76 %N A305900 Filter sequence for a(primes > 3) = constant sequences. %C A305900 For all i, j: %C A305900 a(i) = a(j) => A305801(i) = A305801(j) => A305800(i) = A305800(j). %C A305900 a(i) = a(j) => A007949(i) = A007949(j). %C A305900 a(i) = a(j) => A305893(i) = A305893(j). %H A305900 Antti Karttunen, <a href="/A305900/b305900.txt">Table of n, a(n) for n = 1..100000</a> %F A305900 For n <= 5, a(n) = n, for >= 5, a(n) = 5 when n is a prime, and a(n) = 3+n-A000720(n) when n is a composite. %o A305900 (PARI) A305900(n) = if(n<=5,n,if(isprime(n),5,3+n-primepi(n))); %Y A305900 Cf. A305800, A305801, A305893. %Y A305900 Cf. also A305901, A305902, A305903 (this filter applied to various permutations of N). %K A305900 nonn %O A305900 1,2 %A A305900 _Antti Karttunen_, Jun 14 2018