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 A179383 #8 May 19 2013 11:22:17 %S A179383 1,5,9,11,13,19,25,29,37,53,59,61,67,83,101,107,121,131,139,149,163, %T A179383 173,179,181,197,211,227,269,293,317,347,349,373,379,389,419,421,443, %U A179383 461,467,491,509,523,541,547,557,563,587,613,619,653,659,661,677,701,709,757 %N A179383 a(n) = 2*k(n)-1 where k(n) is the sequence of positions of records in A179382. %C A179383 Records in A179382(k(n)) = 1, 2, 3, 5, 6, 9, 10, 14, 18, 26, 29, .... %C A179383 are located at k(n) = 1, 3, 5, 6, 7, 10, 13, 15, 19, 27, 30, 31,.. %C A179383 The current sequence is a simple transformation of this k(n) sequence. %C A179383 Question: Are there any terms in the sequence with two or more distinct prime divisors? %C A179383 Some very plausible conjectures: 1) The sequence consists of primes and squares of primes; 2) The set of squares is finite; 3) A prime p>=5 is in the sequence iff it has primitive root 2 (A001122) ; 4) There exists l such that, for n>l, A179383(n) =A139099(n+l) . [From _Vladimir Shevelev_ , Jul 14 2010] %H A179383 Peter J. C. Moses, <a href="/A179383/b179383.txt">Table of n, a(n) for n = 1..8500</a> %Y A179383 Cf. A139099, A167791, A002326, A179382 %K A179383 nonn %O A179383 1,2 %A A179383 _Vladimir Shevelev_, Jul 12 2010 %E A179383 Definition rephrased and sequence extended by _R. J. Mathar_, Jul 13 2010 %E A179383 I made a change to Conjecture 4). - _Vladimir Shevelev_, Jul 18 2010