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 A096699 #26 Feb 16 2024 10:05:08 %S A096699 29,977,1381,1439,3109,3539,4357,4397,5563,7159,8273,8737,10711,11117, %T A096699 13109,13841,15101,18731,18839,20543,21391,21851,23459,24877,27653, %U A096699 28477,28697,30677,32029,32971,34631,35863,36979,37019,37529,38189 %N A096699 Balanced primes of order seven. %H A096699 Aaron Toponce, <a href="/A096699/b096699.txt">Table of n, a(n) for n = 1..1000</a> %e A096699 29 is a member because 29 = (5 + 7 + 11 + 13 + 17 + 19 + 23 + 29 + 31 + 37 + 41 + 43 + 47 + 53 + 59)/15. %t A096699 Transpose[ Select[ Partition[ Prime[ Range[5000]], 15, 1], #[[8]] == (#[[1]] + #[[2]] + #[[3]] + #[[4]] + #[[5]] + #[[6]] + #[[7]] + #[[9]] + #[[10]] + #[[11]] + #[[12]] + #[[13]] + #[[14]] + #[[15]])/14 &]][[8]] %t A096699 (* Second program: *) %t A096699 With[{k = 7}, Select[MapIndexed[{Prime[First@ #2 + k], #1} &, Mean /@ Partition[Prime@ Range[5000], 2 k + 1, 1]], SameQ @@ # &][[All, 1]]] (* _Michael De Vlieger_, Feb 15 2018 *) %o A096699 (GAP) P:=Filtered([1..70000],IsPrime);; %o A096699 a:=List(Filtered(List([0..5000],k->List([8..22],j->P[j-7+k])),i-> %o A096699 Sum(i)/15=i[8]),m->m[8]); # _Muniru A Asiru_, Feb 14 2018 %o A096699 (PARI) isok(p) = {if (isprime(p), k = primepi(p); if (k > 7, sum(i=k-7, k+7, prime(i)) == 15*p;););} \\ _Michel Marcus_, Mar 07 2018 %Y A096699 Cf. A096693, A006562, A082077, A082078, A082079, A096697, A096698, A096700, A096701, A096702, A096703, A096704. %K A096699 nonn %O A096699 1,1 %A A096699 _Robert G. Wilson v_, Jun 26 2004