

A005097


(Odd primes  1)/2.


142



1, 2, 3, 5, 6, 8, 9, 11, 14, 15, 18, 20, 21, 23, 26, 29, 30, 33, 35, 36, 39, 41, 44, 48, 50, 51, 53, 54, 56, 63, 65, 68, 69, 74, 75, 78, 81, 83, 86, 89, 90, 95, 96, 98, 99, 105, 111, 113, 114, 116, 119, 120, 125, 128, 131, 134, 135, 138, 140, 141, 146, 153, 155, 156
(list;
graph;
refs;
listen;
history;
text;
internal format)



OFFSET

1,2


COMMENTS

Or, numbers k such that 2k+1 is prime.
Also numbers not of the form 2xy + x + y.  Jose Brox (tautocrona(AT)terra.es), Dec 29 2005
This sequence arises if you factor the product of a large number of the first odd numbers into the form 3^n(3)5^n(5)7^n(7)11^n(11)... Then n(3)/n(5) = 2, n(3)/n(7) = 3, n(3)/n(11) = 5, ... .  Andrzej Staruszkiewicz (astar(AT)th.if.uj.edu.pl), May 31 2007
Kohen shows: A king invites n couples to sit around a round table with 2n+1 seats. For each couple, the king decides a prescribed distance d between 1 and n which the two spouses have to be seated from each other (distance d means that they are separated by exactly d1 chairs). We will show that there is a solution for every choice of the distances if and only if 2n+1 is a prime number [i.e., iff n is in A005097], using a theorem known as Combinatorial Nullstellensatz.  Jonathan Vos Post, Jun 14 2010
Starting from 6, positions at which new primes are seen for Goldbach partitions. E.g., 31 is first seen at 34 from 31+3, so position = 1 + (346)/2 = 15.  Bill McEachen, Jul 05 2010
Perfect errorcorrecting Lee codes of word length n over Z: it is conjectured that these always exist when 2n+1 is a prime, as mentioned in Horak.  Jonathan Vos Post, Sep 19 2011
I conjecture that the set of pairwise sums of terms of this sequence (A005097) is the set of integers greater than 1, i.e.: 1+1=2, 1+2=3, ..., 5+5=10, ... (This is equivalent to Goldbach's conjecture: every even integer greater than or equal to 6 can be expressed as the sum of two odd primes.)  Lear Young, May 20 2014
See conjecture and comments from Richard R. Forberg, in Links section below, on the relationship of this sequence to rules on values of c that allow both p^q+c and p^qc to be prime, for an infinite number of primes p.  Richard R. Forberg, Jul 13 2016
The sequence represents the minimum number Ng of gears which are needed to draw a complete graph of order p using a Spirograph(R), where p is an odd prime. The resulting graph consists of Ng hypotrochoids whose respective nodes coincide. If the teethed ring has a circumference p then Ng = (p1)/2. Examples: A complete graph of order three can be drawn with a Spirograph(R) using a ring with 3n teeth and one gear with n teeth. n is an arbitrary number, only related to the geometry of the gears. A complete graph of order 5 can be drawn using a ring with diameter 5 and 2 gears with diameters 1 and 2 respectively. A complete graph of order 7 can be drawn using a ring with diameter 7 and 3 gears with diameters 1, 2 and 3 respectively.  Bob Andriesse, Mar 31 2017


LINKS



FORMULA



MAPLE

with(numtheory): p:=n> ithprime(n):seq((p(n+1)^21)/(2*sigma(p(n+1))), n= 1..64) # Gary Detlefs, May 02 2012


MATHEMATICA



PROG

(Haskell)
(Python)
from sympy import prime


CROSSREFS

A130290 is an essentially identical sequence.
Cf. A005384 (subsequence of primes), A266400 (their indices in this sequence).


KEYWORD

nonn,easy


AUTHOR



STATUS

approved



