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.

A229966 Numbers n such that A229964(n) = 3.

This page as a plain text file.
%I A229966 #11 Nov 08 2015 03:56:05
%S A229966 12,14,22,27,33,57,85,161,203,533,689,901,1121,1633,2581,4181,5513,
%T A229966 5633,7439,10561,18023,18881,20833,21389,23941,25043,28421,32033,
%U A229966 37733,48641,58241,64643,66901,77423,80033,84001,90133,106439,116821,119201,149189,155041
%N A229966 Numbers n such that A229964(n) = 3.
%C A229966 Equals {12, 14, 22, 27, 57} UNION {pq | p, q prime, q = 3p+2 or (p >= 5 and q = 4p+1)}.
%H A229966 Eric M. Schmidt, <a href="/A229966/b229966.txt">Table of n, a(n) for n = 1..1000</a>
%H A229966 Rosemary Sullivan and Neil Watling, <a href="http://www.emis.de/journals/INTEGERS/papers/n65/n65.Abstract.html">Independent Divisibility Pairs on the Set of Integers from 1 to N</a>, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 13, Paper A65, 2013.
%o A229966 (Sage) [p * (3*p+2) for p in prime_range(10000) if (3*p+2).is_prime()] + [p * (4*p+1) for p in prime_range(5, 10000) if (4*p+1).is_prime()] + [12, 14, 22, 27, 57]
%Y A229966 Cf. A166684, A082663, A229965, A229967, A023208, A023212.
%K A229966 nonn
%O A229966 1,1
%A A229966 _Eric M. Schmidt_, Oct 04 2013