cp's OEIS Frontend

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.

A165240 Integers of the form (a+b+c+..+z)/z where (a,b,c,..,z) is a list of 2 or more distinct consecutive nonprimes.

This page as a plain text file.
%I A165240 #7 Mar 31 2012 12:38:26
%S A165240 3,4,6,7,8,9,10,11,12,13,14,15,16,17,18,20,21,22,23,24,25,26,27,28,29,
%T A165240 30,31,32,33,34,35,36,37,38,39,40,41,42,43,44,45,46,47,48,49,50,51,52,
%U A165240 53,54,55,56,57,58,59,60,61,62,63,64,66,67,68,69,70,71,72,73,74,75,76
%N A165240 Integers of the form (a+b+c+..+z)/z where (a,b,c,..,z) is a list of 2 or more distinct consecutive nonprimes.
%C A165240 Contains A165239 (except 1) as a subsequence.
%e A165240 (4+6+8+9)/9=3;
%e A165240 (9+10+12+14+15)/15=4;
%e A165240 (10+12+14+15+16+18+20+21)/21=6;
%e A165240 (6+8+9+10+12+14+15+16+18)/18=6;
%e A165240 (14+15+16+18+20+21+22+24+25)/25=7;
%e A165240 (1+4+6+8+9+10+12+14+15+16+18+20+21+22)/22=8;
%t A165240 lst={};Do[a=0;If[ !PrimeQ[q],Do[If[ !PrimeQ[n],m=n;a+=m;e=a/n;If[IntegerQ[e]&&a!=n,If[e<83,AppendTo[lst,e],Break[]]]],{n,q,3*6!}]],{q,2*6!}];lst=Take[Union@lst,77]
%Y A165240 Cf. A018252.
%K A165240 nonn
%O A165240 1,1
%A A165240 _Vladimir Joseph Stephan Orlovsky_, Sep 09 2009