oeis-0.3.7/0000755000000000000000000000000012741217037010652 5ustar0000000000000000oeis-0.3.7/LICENSE0000644000000000000000000000270012741217037011656 0ustar0000000000000000Copyright (c) Brent Yorgey 2007, Brian Lewis 2013 All rights reserved. Redistribution and use in source and binary forms, with or without modification, are permitted provided that the following conditions are met: 1. Redistributions of source code must retain the above copyright notice, this list of conditions and the following disclaimer. 2. Redistributions in binary form must reproduce the above copyright notice, this list of conditions and the following disclaimer in the documentation and/or other materials provided with the distribution. 3. Neither the name of the author nor the names of other contributors may be used to endorse or promote products derived from this software without specific prior written permission. THIS SOFTWARE IS PROVIDED BY THE AUTHORS ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHORS OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. oeis-0.3.7/Setup.hs0000644000000000000000000000014512741217037012306 0ustar0000000000000000module Main (main) where import Distribution.Simple (defaultMain) main :: IO () main = defaultMain oeis-0.3.7/oeis.cabal0000644000000000000000000000346212741217037012602 0ustar0000000000000000name: oeis version: 0.3.7 category: Math stability: experimental author: Brent Yorgey maintainer: Brian Lewis license: BSD3 license-file: LICENSE synopsis: Interface to the Online Encyclopedia of Integer Sequences (OEIS) description: Interface to the . cabal-version: >= 1.10 build-type: Custom -------------------------------------------------------------------------------- extra-source-files: README.md test/data/id_rsp.txt test/data/seq_rsp.txt -------------------------------------------------------------------------------- flag network-uri description: Get Network.URI from the network-uri package default: True library default-language: Haskell2010 ghc-options: -Wall -O2 if impl(ghc >= 6.8) ghc-options: -fwarn-tabs exposed-modules: Math.OEIS Math.OEIS.Internal other-modules: Math.OEIS.Types build-depends: HTTP >= 4000.2 && < 4000.4, base >= 3 && < 5 if flag(network-uri) build-depends: network-uri >= 2.6, network >= 2.6 else build-depends: network-uri < 2.6, network < 2.6 -------------------------------------------------------------------------------- test-suite main default-language: Haskell2010 ghc-options: -Wall -O2 if impl(ghc >= 6.8) ghc-options: -fwarn-tabs type: exitcode-stdio-1.0 hs-source-dirs: test main-is: Test.hs build-depends: HUnit >= 1.2 && < 1.4, base >= 3 && < 5, oeis == 0.3.*, test-framework == 0.8.*, test-framework-hunit == 0.3.* -------------------------------------------------------------------------------- source-repository head   type: git   location: git://github.com/bsl/oeis.git oeis-0.3.7/README.md0000644000000000000000000000017712741217037012136 0ustar0000000000000000`Math.OEIS` is a library module for interfacing with the [Online Encyclopedia of Integer Sequences][1]. [1]: http://oeis.org/ oeis-0.3.7/Math/0000755000000000000000000000000012741217037011543 5ustar0000000000000000oeis-0.3.7/Math/OEIS.hs0000644000000000000000000002054012741217037012637 0ustar0000000000000000module Math.OEIS ( -- * Example usage -- $sample -- * Lookup functions getSequenceByID, lookupSequenceByID , extendSequence, lookupSequence , getSequenceByID_IO, lookupSequenceByID_IO , extendSequence_IO, lookupSequence_IO , searchSequence_IO, lookupOEIS -- * Data structures , SequenceData , Language(..), Keyword(..) , OEISSequence(..) ) where -------------------------------------------------------------------------------- import Data.Char (isDigit, isSpace) import Data.List (isPrefixOf, tails) import Data.Maybe (listToMaybe, fromMaybe) import Network.URI (escapeURIString, isAllowedInURI) import System.IO.Unsafe (unsafePerformIO) import Math.OEIS.Internal import Math.OEIS.Types -------------------------------------------------------------------------------- -- | Interpret a string as a OEIS request, and return the results as Strings. lookupOEIS :: String -> IO [String] lookupOEIS a = do let a' = commas . reverse . dropWhile isSpace . reverse . dropWhile isSpace $ a x <- searchSequence_IO a' case x of Nothing -> return ["Sequence not found."] Just s -> return [description s, show $ sequenceData s] where commas [] = [] commas (x:' ':xs) | isDigit x = x : ',' : commas xs commas (x:xs) = x : commas xs -- | Look up a sequence in the OEIS using its search function. searchSequence_IO :: String -> IO (Maybe OEISSequence) searchSequence_IO x = getOEIS (baseSearchURI ++) (escapeURIString isAllowedInURI x) -- | Look up a sequence in the OEIS by its catalog number. Generally this would -- be its A-number, but M-numbers (from the /Encyclopedia of Integer -- Sequences/) and N-numbers (from the /Handbook of Integer Sequences/) can be -- used as well. -- -- Note that the result is not in the 'IO' monad, even though the -- implementation requires looking up information via the Internet. There are -- no side effects to speak of, and from a practical point of view the function -- is referentially transparent (OEIS A-numbers could change in theory, but -- it's extremely unlikely). -- -- Examples: -- -- > Prelude Math.OEIS> getSequenceByID "A000040" -- the prime numbers -- > Just [2,3,5,7,11,13,17,19,23,29,31,37,41,43,47... -- > -- > Prelude Math.OEIS> getSequenceByID "nosuch" -- no such sequence! -- > Nothing getSequenceByID :: String -> Maybe SequenceData getSequenceByID = unsafePerformIO . getSequenceByID_IO -- | The same as 'getSequenceByID', but with a result in the 'IO' monad. getSequenceByID_IO :: String -> IO (Maybe SequenceData) getSequenceByID_IO x = fmap (fmap sequenceData) (lookupSequenceByID_IO x) -- | Look up a sequence by ID number, returning a data structure containing the -- entirety of the information the OEIS has on the sequence. -- -- The standard disclaimer about not being in the 'IO' monad applies. -- -- Examples: -- -- > Prelude Math.OEIS> description `fmap` lookupSequenceByID "A000040" -- > Just "The prime numbers." -- > -- > Prelude Math.OEIS> keywords `fmap` lookupSequenceByID "A000105" -- > Just [Nonn,Hard,Nice,Core] lookupSequenceByID :: String -> Maybe OEISSequence lookupSequenceByID = unsafePerformIO . lookupSequenceByID_IO -- | The same as 'lookupSequenceByID', but in the 'IO' monad. lookupSequenceByID_IO :: String -> IO (Maybe OEISSequence) lookupSequenceByID_IO = getOEIS idSearchURI -- | Extend a sequence by using it as a lookup to the OEIS, taking the first -- sequence returned as a result, and using it to augment the original -- sequence. -- -- Note that @xs@ is guaranteed to be a prefix of @extendSequence xs@. If the -- matched OEIS sequence contains any elements prior to those matching @xs@, -- they will be dropped. In addition, if no matching sequences are found, @xs@ -- will be returned unchanged. -- -- The result is not in the 'IO' monad even though the implementation requires -- looking up information via the Internet. There are no side effects, and -- practically speaking this function is referentially transparent -- (technically, results may change from time to time when the OEIS database is -- updated; this is slightly more likely than the results of 'getSequenceByID' -- changing, but still unlikely enough to be essentially a non-issue. Again, -- purists may use 'extendSequence_IO'). -- -- Examples: -- -- > Prelude Math.OEIS> extendSequence [5,7,11,13,17] -- > [5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71... -- -- > Prelude Math.OEIS> extendSequence [2,4,8,16,32] -- > [2,4,8,16,32,64,128,256,512,1024,2048,4096,8192... -- -- > Prelude Math.OEIS> extendSequence [9,8,7,41,562] -- nothing matches -- > [9,8,7,41,562] extendSequence :: SequenceData -> SequenceData extendSequence = unsafePerformIO . extendSequence_IO -- | The same as 'extendSequence', but in the 'IO' monad. extendSequence_IO :: [Integer] -> IO [Integer] extendSequence_IO [] = return [] extendSequence_IO xs = do oeis <- lookupSequence_IO xs return $ case oeis of Nothing -> xs Just s -> extend xs (sequenceData s) -- | @extend xs ext@ returns the maximal suffix of @ext@ of which @xs@ is a -- prefix, or @xs@ if @xs@ is not a prefix of any suffixes of @ext@. It is -- guaranteed that -- -- > forall xs ext. xs `isPrefixOf` (extend xs ext) extend :: SequenceData -> SequenceData -> SequenceData extend xs ext = fromMaybe xs . listToMaybe . filter (xs `isPrefixOf`) $ tails ext -- | Find a matching sequence in the OEIS database, returning a data structure -- containing the entirety of the information the OEIS has on the sequence. -- -- The standard disclaimer about not being in the 'IO' monad applies. lookupSequence :: SequenceData -> Maybe OEISSequence lookupSequence = unsafePerformIO . lookupSequence_IO -- | The same as 'lookupSequence', but in the 'IO' monad. lookupSequence_IO :: SequenceData -> IO (Maybe OEISSequence) lookupSequence_IO = getOEIS seqSearchURI -------------------------------------------------------------------------------- {- $sample Suppose we are interested in answering the question, \"how many distinct binary trees are there with exactly 20 nodes?\" Some naive code to answer this question might be as follows: > import Data.List (genericLength) > > -- data-less binary trees. > data BTree = Empty | Fork BTree BTree deriving Show > > -- A list of all the binary trees with exactly n nodes. > listTrees :: Int -> [BTree] > listTrees 0 = [Empty] > listTrees n = [Fork left right | > k <- [0..n-1], > left <- listTrees k, > right <- listTrees (n-1-k) ] > > countTrees :: Int -> Integer > countTrees = genericLength . listTrees The problem, of course, is that @countTrees@ is horribly inefficient: @ *Main> :set +s *Main> countTrees 5 42 (0.00 secs, 0 bytes) *Main> countTrees 10 16796 (0.47 secs, 27513240 bytes) *Main> countTrees 12 208012 (7.32 secs, 357487720 bytes) *Main> countTrees 13 *** Exception: stack overflow @ There's really no way we can evaluate @countTrees 20@. The solution? Cheat! > import Math.OEIS > > -- countTrees works ok up to 10 nodes. > -- [1,2,5,14,42,132,429,1430,4862,16796] > smallTreeCounts = map countTrees [0..10] > > -- now, extend the sequence via the OEIS! > treeCounts = extendSequence smallTreeCounts Now we can answer the question: > *Main> treeCounts !! 20 > 6564120420 Sweet. Of course, to have any sort of confidence in our answer, more research is required! Let's see what combinatorial goodness we have stumbled across. @ *Main> description \`fmap\` lookupSequence smallTreeCounts Just \"Catalan numbers: C(n) = binomial(2n,n)\/(n+1) = (2n)!\/(n!(n+1)!). Also called Segner numbers.\" @ Catalan numbers, interesting. And a nice formula we could use to code up a /real/ solution! Hmm, where can we read more about these so-called \'Catalan numbers\'? @ *Main> (head . references) \`fmap\` lookupSequence smallTreeCounts Just [\"A. Bernini, F. Disanto, R. Pinzani and S. Rinaldi, Permutations defining convex permutominoes, preprint, 2007.\"] *Main> (head . links) \`fmap\` lookupSequence smallTreeCounts Just [\"N. J. A. Sloane, \The first 200 Catalan numbers\<\/a\>\"] @ And so on. Reams of collected mathematical knowledge at your fingertips! You must promise only to use this power for Good. -} -------------------------------------------------------------------------------- {-# ANN module "HLint: ignore Use camelCase" #-} oeis-0.3.7/Math/OEIS/0000755000000000000000000000000012741217037012302 5ustar0000000000000000oeis-0.3.7/Math/OEIS/Internal.hs0000644000000000000000000001114512741217037014414 0ustar0000000000000000-- | This module exists just to facilitate testing. -- /Nothing here is part of the OEIS API./ module Math.OEIS.Internal where -------------------------------------------------------------------------------- import Control.Arrow (second, (***)) import Data.Char (isSpace, toUpper, toLower) import Data.List (intercalate, isPrefixOf, foldl') import Network.HTTP (simpleHTTP, rspBody, rspCode, rqBody, rqHeaders, rqMethod, rqURI, Request(..), RequestMethod(GET)) import Network.URI (parseURI, URI) import Math.OEIS.Types -------------------------------------------------------------------------------- baseSearchURI :: String baseSearchURI = "http://oeis.org/search?fmt=text&q=" idSearchURI :: String -> String idSearchURI n = baseSearchURI ++ "id:" ++ n seqSearchURI :: SequenceData -> String seqSearchURI xs = baseSearchURI ++ intercalate "," (map show xs) getOEIS :: (a -> String) -> a -> IO (Maybe OEISSequence) getOEIS toURI key = case parseURI (toURI key) of Nothing -> return Nothing Just uri -> do mbody <- get uri return $ case mbody of Nothing -> Nothing Just body -> parseOEIS body get :: URI -> IO (Maybe String) get uri = do ersp <- simpleHTTP (request uri) return $ case ersp of Left _ -> Nothing Right rsp | rspCode rsp == (2,0,0) -> Just $ rspBody rsp | otherwise -> Nothing request :: URI -> Request String request uri = Request { rqURI = uri , rqMethod = GET , rqHeaders = [] , rqBody = "" } readKeyword :: String -> Keyword readKeyword = read . capitalize capitalize :: String -> String capitalize "" = "" capitalize (c:cs) = toUpper c : map toLower cs emptyOEIS :: OEISSequence emptyOEIS = OEIS [] [] [] "" [] [] [] [] "" 0 0 [] [] [] [] [] addElement :: (Char, String) -> OEISSequence -> OEISSequence addElement ('I', x) c = c { catalogNums = words x } addElement (t, x) c | t `elem` "STU" = c { sequenceData = nums ++ sequenceData c } where nums = map read $ csvItems x addElement (t, x) c | t `elem` "VWX" = c { signedData = nums ++ signedData c } where nums = map read $ csvItems x addElement ('N', x) c = c { description = x } addElement ('D', x) c = c { references = x : references c } addElement ('H', x) c = c { links = x : links c } addElement ('F', x) c = c { formulas = x : formulas c } addElement ('Y', x) c = c { xrefs = x : xrefs c } addElement ('A', x) c = c { author = x } addElement ('O', x) c = c { offset = read o , firstGT1 = read f } where (o,f) = second tail . span (/=',') $ x addElement ('p', x) c = c { programs = (Mathematica, x) : programs c } addElement ('t', x) c = c { programs = (Maple, x) : programs c } addElement ('o', x) c = c { programs = (Other, x) : programs c } addElement ('E', x) c = c { extensions = x : extensions c } addElement ('e', x) c = c { examples = x : examples c } addElement ('K', x) c = c { keywords = parseKeywords x } addElement ('C', x) c = c { comments = x : comments c } addElement _ c = c parseOEIS :: String -> Maybe OEISSequence parseOEIS x = if "No results." `isPrefixOf` (ls!!3) then Nothing else Just . foldl' (flip addElement) emptyOEIS . reverse . parseRawOEIS $ ls' where ls = lines x ls' = init . drop 5 $ ls parseRawOEIS :: [String] -> [(Char, String)] parseRawOEIS = map parseItem . combineConts parseKeywords :: String -> [Keyword] parseKeywords = map readKeyword . csvItems csvItems :: String -> [String] csvItems "" = [] csvItems x = item : others where (item, rest) = span (/=',') x others = csvItems $ del ',' rest del :: Char -> String -> String del _ "" = "" del c (x:xs) | c==x = xs | otherwise = x:xs parseItem :: String -> (Char, String) parseItem s = (c, str) where ( '%':c:_ , rest) = splitWord s (_, str ) = if c == 'I' then ("", rest) else splitWord rest combineConts :: [String] -> [String] combineConts (s@('%':_:_) : ss) = uncurry (:) . (joinConts s *** combineConts) . break isItem $ ss combineConts ss = ss splitWord :: String -> (String, String) splitWord = second trimLeft . break isSpace isItem :: String -> Bool isItem x = not (null x) && '%' == head x joinConts :: String -> [String] -> String joinConts s conts = s ++ concatMap trimLeft conts trimLeft :: String -> String trimLeft = dropWhile isSpace oeis-0.3.7/Math/OEIS/Types.hs0000644000000000000000000000470312741217037013746 0ustar0000000000000000module Math.OEIS.Types where type SequenceData = [Integer] -- | Programming language that some code to generate the sequence is written -- in. The only languages indicated natively by the OEIS database are -- Mathematica and Maple; any other languages will be listed (usually in -- parentheses) at the beginning of the actual code snippet. data Language = Mathematica | Maple | Other deriving Show -- | OEIS keywords. For more information on the meaning of each keyword, see -- . data Keyword = Base | Bref | Changed | Cofr | Cons | Core | Dead | Dumb | Dupe | Easy | Eigen | Fini | Frac | Full | Hard | More | Mult | New | Nice | Nonn | Obsc | Sign | Tabf | Tabl | Uned | Unkn | Walk | Word deriving (Eq,Show,Read) -- | Data structure for storing an OEIS entry. For more information on the -- various components, see . data OEISSequence = OEIS { catalogNums :: [String], -- ^ Catalog number(s), e.g. A000040, N1425. (%I) sequenceData :: SequenceData, -- ^ The actual sequence data (or absolute values of the sequence data in the case of signed sequences). (%S,T,U) signedData :: SequenceData, -- ^ Signed sequence data (empty for sequences with all positive entries). (%V,W,X) description :: String, -- ^ Short description of the sequence. (%N) references :: [String], -- ^ List of academic references. (%D) links :: [String], -- ^ List of links to more information on the web. (%H) formulas :: [String], -- ^ Formulas or equations involving the sequence. (%F) xrefs :: [String], -- ^ Cross-references to other sequences. (%Y) author :: String, -- ^ Author who input the sequence into the database. (%A) offset :: Int, -- ^ Subscript\/index of the first term. (%O) firstGT1 :: Int, -- ^ Index of the first term \> 1. (%O) programs :: [(Language,String)], -- ^ Code that can be used to generate the sequence. (%p,t,o) extensions :: [String], -- ^ Corrections, extensions, or edits. (%E) examples :: [String], -- ^ Examples. (%e) keywords :: [Keyword], -- ^ Keywords. (%K) comments :: [String] -- ^ Comments. (%C) } deriving Show oeis-0.3.7/test/0000755000000000000000000000000012741217037011631 5ustar0000000000000000oeis-0.3.7/test/Test.hs0000644000000000000000000000431212741217037013104 0ustar0000000000000000-- base import Data.List (isPrefixOf) import System.IO (IOMode(ReadMode), hGetContents, hSetEncoding, openFile, utf8) -- HUnit import Test.HUnit ((@?=), assertBool, assertFailure) -- test-framework import Test.Framework (Test, defaultMain, testGroup) -- test-framework-hunit import Test.Framework.Providers.HUnit (testCase) -- oeis import Math.OEIS import Math.OEIS.Internal -------------------------------------------------------------------------------- main :: IO () main = defaultMain tests -------------------------------------------------------------------------------- tests :: [Test] tests = [ testGroup "internals" [ testCase "parseOEIS" test_parseOEIS ] ] -------------------------------------------------------------------------------- test_parseOEIS :: IO () test_parseOEIS = do r0 <- readFileUtf8 "test/data/id_rsp.txt" case parseOEIS r0 of Nothing -> assertFailure "" Just r -> do check r examples r @?= [] r1 <- readFileUtf8 "test/data/seq_rsp.txt" case parseOEIS r1 of Nothing -> assertFailure "" Just r -> do check r assertBool "" $ not $ null $ examples r where check r = do catalogNums r @?= ["A000040","M0652","N0241"] assertBool "" $ firstFewPrimes `isPrefixOf` sequenceData r signedData r @?= [] description r @?= "The prime numbers." assertBool "" $ not $ null $ references r assertBool "" $ not $ null $ links r assertBool "" $ not $ null $ formulas r assertBool "" $ not $ null $ xrefs r author r @?= "_N. J. A. Sloane_." assertBool "" $ not $ null $ programs r assertBool "" $ not $ null $ extensions r assertBool "" $ [Core,Nonn,Nice,Easy] `elemAll` keywords r firstFewPrimes = [2,3,5,7,11,13,17,19,23,29,31,37] elemAll xs ys = all (`elem` ys) xs -------------------------------------------------------------------------------- readFileUtf8 :: FilePath -> IO String readFileUtf8 fp = do h <- openFile fp ReadMode hSetEncoding h utf8 hGetContents h -------------------------------------------------------------------------------- {-# ANN module "HLint: ignore Use camelCase" #-} oeis-0.3.7/test/data/0000755000000000000000000000000012741217037012542 5ustar0000000000000000oeis-0.3.7/test/data/id_rsp.txt0000644000000000000000000006416712741217037014601 0ustar0000000000000000# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: id:a000040 Showing 1-1 of 1 %I A000040 M0652 N0241 %S A000040 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89, %T A000040 97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179, %U A000040 181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271 %N A000040 The prime numbers. %C A000040 A number n is prime if it is greater than 1 and has no positive divisors except 1 and n. %C A000040 A natural number is prime if and only if it has exactly two (positive) divisors. %C A000040 A prime has exactly one proper positive divisor, 1. %C A000040 The sum of an odd number > 1 (2i+1, i >= 1) of consecutive positive odd numbers centered on the j-th odd number >= 2i+1 (2j+1, j >= i) being (2i+1)*(2j+1) has 2 or more odd prime factors (odd semiprime iff 2i+1 and 2j+1 are primes). - _Daniel Forgues_, Jul 15 2009 %C A000040 The paper by Kaoru Motose starts as follows: "Let q be a prime divisor of a Mersenne number 2^p-1 where p is prime. Then p is the order of 2 (mod q). Thus p is a divisor of q-1 and q>p. This shows that there exist infinitely many prime numbers." - Pieter Moree, Oct 14 2004 %C A000040 1 is not a prime, for if the primes included 1, then the factorization of a natural number n into a product of primes would not be unique, since n = n*1. %C A000040 1 is the empty product (has 0 prime factors) whereas a prime has 1 prime factor (itself). - Daniel Forgues, Jul 23 2009 %C A000040 Prime(n) and pi(n) are inverse functions: A000720(a(n)) = n and a(n) is the least number m such that a(A000720(m)) = a(n). a(A000720(n)) = n if (and only if) n is prime. %C A000040 Elementary primality test: If no prime =< sqrt(m) divides m, then m is prime (since a prime is its own exclusive multiple, apart from 1). - _Lekraj Beedassy_, Mar 31 2005 %C A000040 Second sequence ever computed by electronic computer, on EDSAC, May 9 1949 (see Renwick link). - _Russ Cox_, Apr 20 2006 %C A000040 Every prime p is a linear combination of previous primes p(n) with nonzero coefficients c(n) and |c(n)| < p(n). - Amarnath Murthy, Franklin T. Adams-Watters and Joshua Zucker, May 17 2006 %C A000040 Odd primes can only be written as a sum of two consecutive integers. Powers of 2 do not have a representation as a sum of k consecutive integers (other than the trivial n=n, for k=1). See A111774. - _Jaap Spies_, Jan 04 2007 %C A000040 There is a unique decomposition of the primes: provided the weight A117078(n) is > 0, we have prime(n) = weight * level + gap, or A000040(n) = A117078(n) * A117563(n) + A001223(n). - _Rémi Eismann_, Feb 16 2007 %C A000040 Equals row sums of triangle A143350. [_Gary W. Adamson_, Aug 10 2008] %C A000040 APSO (Alternating partial sums of sequence) a-b+c-d+e-f+g... = (a+b+c+d+e+f+g...)-2*(b+d+f...): APSO(A000040) = A008347=A007504 - 2*(A077126 repeated) (A007504-A008347)/2 = A077131 alternated with A077126. - _Eric Desbiaux_, Oct 28 2008 %C A000040 The Greek transliteration of 'Prime Number' is 'Proton Arithmon'. [_Daniel Forgues_, May 08 2009] %C A000040 It appears that, with the Bachet-Bezout theorem, A000040 = (2*A039701)+(3*A157966). - _Eric Desbiaux_, Nov 15 2009 %C A000040 a(n) = A008864(n) - 1 = A052147(n) - 2 = A113395(n) - 3 = A175221(n) - 4 = A175222(n) - 5 = A139049(n) - 6 = A175223(n) - 7 = A175224(n) - 8 = A140353(n) - 9 = A175225(n) - 10. [From _Jaroslav Krizek_, Mar 06 2010] %C A000040 2 and 3 might be referred to as the two "forcibly prime numbers" since there are no integers greater than 1 and less than or equal to their respective square roots. Not a single trial division ever needs to be done for 2 or 3, so they are disqualified from the get go from any attempt to belong to the set of composite numbers. 2 and 3 are thus the only consecutive primes. Since any further prime needs to be coprime to both 2 and 3, they can only be congruent to 5 or 1 (mod 2*3) and thus must all be of the form (2*3)*k -/+ 1 with k >= 1. When both (2*3)*k - 1 and (2*3)*k + 1 are prime for a given k >= 1, they are referred to as twin primes. (3 and 5 being the only twin primes of the form (2*2)*k - 1 and (2*2)*k + 1). - _Daniel Forgues_, Mar 19 2010 %C A000040 For prime n, the sum of divisors of n > product of divisors of n. Sigma(n)==1 (mod n). - _Juri-Stepan Gerasimov_, Mar 12 2011 %C A000040 Conjecture: a(n) = (6*f(n)+(-1)^f(n)-3)/2, n>2, where f(n) = floor(ithprime(n)/3)+1. See A181709. - _Gary Detlefs_, Dec 12 2011 %C A000040 Odd prime p divides some (2^k + 1) or (2^k - 1), (k>0, minimal, Cf. A003558) depending on the parity of A179480((p+1)/2) = r. This is a consequence of the Quasi-order theorem and corollaries, [Hilton and Pederson, pp. 260-264]: 2^k == (-1)^r mod b, b odd; and b divides 2^k - (-1)^r, where p is a subset of b. - _Gary W. Adamson_, Aug 26 2012 %C A000040 A number n is prime if and only if it is different from zero and different from a unit and each multiple of n decomposes into factors such that n divides at least one of the factors. This definition has the advantage that it does not make an assertion on the number of divisors of n. It applies equally for the integers (where a prime has exactly four divisors) and the natural numbers (where a prime has exactly two divisors). - _Peter Luschny_, Oct 09 2012 %C A000040 Motivated by his conjecture on representations of integers by alternating sums of consecutive primes, for any positive integer n, Zhi-Wei Sun conjectured that the polynomial P_n(x)= sum_{k=0}^n a(k+1)*x^k is irreducible over the field of rational numbers with the Galois group S_n, and moreover P_n(x) is irreducible mod a(m) for some m<=n(n+1)/2. It seems that no known criterion on irreduciblity of polynomials implies this conjecture. - _Zhi-Wei Sun_, Mar 23 2013 %D A000040 M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P, Ann. of Math. (2) 160 (2004), no. 2, 781-793. %D A000040 M. Aigner and G. M. Ziegler, Proofs from The Book, Springer-Verlag, Berlin, 2nd. ed., 2001; see p. 3. %D A000040 T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 2. %D A000040 E. Bach and __Jeffrey Shallit__, Algorithmic Number Theory, I, Chaps. 8, 9. %D A000040 P. T. Bateman and H. G. Diamond, A hundred years of prime numbers, Amer. Math. Monthly, Vol. 103 (1996) pp. 729-741. %D A000040 D. M. Bressoud, Factorization and Primality Testing, Springer-Verlag NY 1989. %D A000040 C. K. Caldwell and Y. Xiong, What is the smallest prime?, J. Integer Seq. 15 (2012), no. 9, Article 12.9.7, 14 pp., arXiv:1209.2007, 2012. - From _N. J. A. Sloane_, Dec 26 2012 %D A000040 M. Cipolla, "La determinazione asintotica dell'n-mo numero primo.", Rend. d. R. Acc. di sc. fis. e mat. di Napoli, s. 3, VIII (1902), pp. 132-166. %D A000040 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 1. %D A000040 J.-P. Delahaye, Merveilleux nombres premiers, Pour la Science-Belin Paris, 2000. %D A000040 J.-P. Delahaye, Savoir si un nombre est premier: facile, Pour La Science, 303(1) 2003, pp. 98-102. %D A000040 M. Dietzfelbinger, Primality Testing in Polynomial Time, Springer NY 2004. %D A000040 U. Dudley, Formulas for primes, Math. Mag., 56 (1983), 17-22. %D A000040 Pierre Dusart, Autour de la fonction qui compte le nombre de nombres premiers, Dissertation, Universite de Limoges (1998). %D A000040 Pierre Dusart, The k-th prime is greater than k(ln k + ln ln k-1) for k>=2, Mathematics of Computation 68: (1999), 411-415. %D A000040 J. Elie, "L'algorithme AKS", in 'Quadrature', No. 60, pp. 22-32, 2006 EDP-sciences, Les Ulis (France); %D A000040 Seymour. B. Elk, "Prime Number Assignment to a Hexagonal Tessellation of a Plane That Generates Canonical Names for Peri-Condensed Polybenzenes", J. Chem. Inf. Comput. Sci., vol. 34 (1994), pp. 942-946. %D A000040 W. & F. Ellison, Prime Numbers, Hermann Paris 1985 %D A000040 T. Estermann, Introduction to Modern Prime Number Theory, Camb. Univ. Press, 1969. %D A000040 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 2. %D A000040 Peter Hilton and Jean Pedersen, A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics, Cambridge University Press, 2010, pp. (260-264). %D A000040 H. D. Huskey, Derrick Henry Lehmer [1905-1991]. IEEE Ann. Hist. Comput. 17 (1995), no. 2, 64-68. Math. Rev. 96b:01035 %D A000040 M. N. Huxley, The Distribution of Prime Numbers, Oxford Univ. Press, 1972. %D A000040 D. S. Jandu, Prime Numbers And Factorization, Infinite Bandwidth Publishing, N. Hollywood CA 2007. %D A000040 E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Chelsea, NY, 1974. %D A000040 D. H. Lehmer, The sieve problem for all-purpose computers. Math. Tables and Other Aids to Computation, Math. Tables and Other Aids to Computation, 7, (1953). 6-14. Math. Rev. 14:691e %D A000040 D. N. Lehmer, "List of Prime Numbers from 1 to 10,006,721", Carnegie Institute, Washington, D.C. 1909. %D A000040 W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 1, Chap. 6. %D A000040 H. Lifchitz, Table Des nombres Premiers de 0 a 20 millions (Tomes I & II), Albert Blanchard, Paris 1971. %D A000040 R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: their history and some applications. Nieuw Arch. Wisk. (4) 13 (1995), no. 1, 113-139. Math. Rev. 96m:11082 %D A000040 Kaoru Motose, On values of cyclotomic polynomials. II, Math. J. Okayama Univ. 37 (1995), 27-36. %D A000040 P. Ribenboim, The New Book of Prime Number Records, Springer-Verlag NY 1995. %D A000040 P. Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. %D A000040 H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkhaeuser Boston, Cambridge MA 1994. %D A000040 B. Rittaud, "31415879. Ce nombre est-il premier?" ['Is this number prime?'], La Recherche, Vol. 361, pp. 70-73, Feb 15 2003, Paris. %D A000040 J. Barkley Rosser, Explicit Bounds for Some Functions of Prime Numbers, American Journal of Mathematics 63 (1941) 211-232. %D A000040 M. du Sautoy, The Music of the Primes, Fourth Estate / HarperCollins, 2003; see p. 5. %D A000040 D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd. ed., Chelsea, 1978, Chap. 1. %D A000040 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000040 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A000040 D. Wells, Prime Numbers:The Most Mysterious Figures In Math, J.Wiley NY 2005. %D A000040 H. C. Williams and __Jeffrey Shallit__, Factoring integers before computers. Mathematics of Computation 1943-1993: a half-century of computational mathematics (Vancouver, BC, 1993), 481-531, Proc. Sympos. Appl. Math., 48, AMS, Providence, RI, 1994. Math. Rev. 95m:11143 %H A000040 N. J. A. Sloane, Table of n, prime(n) for n = 1..10000 %H A000040 N. J. A. Sloane, Table of n, prime(n) for n = 1..100000 %H A000040 M. Agrawal, N. Kayal & N. Saxena, PRIMES is in P, Annals of Maths., 160:2 (2004), pp. 781-793. [alternate link] %H A000040 M. Agrawal, A Short History of "PRIMES is in P" %H A000040 P. Alfeld, Notes and Literature on Prime Numbers %H A000040 Anonymous, Prime Number Master Index (for primes up to 2*10^7) %H A000040 Anonymous, prime number %H A000040 D. J. Bernstein, Proving Primality After Agrawal-Kayal-Saxena %H A000040 D. J. Bernstein, Distinguishing prime numbers from composite numbers %H A000040 P. Berrizbeitia, Sharpening "Primes is in P" for a large family of numbers %H A000040 A. Booker, The Nth Prime Page %H A000040 F. Bornemann, PRIMES Is in P:A Breakthrough for "Everyman" %H A000040 A. Bowyer, Formulae for Primes %H A000040 B. M. Bredikhin, Prime number %H A000040 R. P. Brent, Primality testing and integer factorization %H A000040 J. Britton, Prime Number List %H A000040 D. Butler, The first 2000 Prime Numbers %H A000040 C. K. Caldwell, The Prime Pages %H A000040 C. K. Caldwell, Tables of primes %H A000040 C. K. Caldwell, The first 10000 primes %H A000040 C. K. Caldwell, A Primality Test %H A000040 C. K. Caldwell and Y. Xiong, What is the smallest prime? %H A000040 M. Chamness, Prime number generator (Applet) %H A000040 P. Cox, Primes is in P %H A000040 P. J. Davis & R. Hersh, The Mathematical Experience, The Prime Number Theorem %H A000040 J.-M. De Koninck, Les nombres premiers: mysteres et consolation %H A000040 J.-M. De Koninck, Nombres premiers: mysteres et enjeux %H A000040 J.-P. Delahaye, Formules et nombres premiers %H A000040 J. Elie, L'algorithme AKS ou Les nombres premiers sont de classe P %H A000040 L. Euler, Observations on a theorem of Fermat and others on looking at prime numbers %H A000040 W. Fendt, Table of Primes from 1 to 1000000000000 %H A000040 P. Flajolet, S. Gerhold and B. Salvy, On the non-holonomic character of logarithms, powers and the n-th prime function %H A000040 J. Flamant, Primes up to one million %H A000040 K. Ford, Expositions of the PRIMES is in P theorem. %H A000040 L. & Y. Gallot, The Chronology of Prime Number Records %H A000040 P. Garrett, Big Primes, Factoring Big Integers %H A000040 P. Garrett, Naive Primality Test %H A000040 P. Garrett, Listing Primes %H A000040 N. Gast, PRIMES is in P: Manindra Agrawal, Neeraj Kayal and Nitin Saxena (in French) %H A000040 D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yildirim, Small gaps between primes and almost primes %H A000040 A. Granville, It is easy to determine whether a given integer is prime [alternate link] %H A000040 P. Hartmann, Prime number proofs (in German) %H A000040 ICON Project, List of first 50000 primes grouped within ten columns %H A000040 N. Kayal & N. Saxena, Resonance 11-2002, A polynomial time algorithm to test if a number is prime or not %H A000040 E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, vol. 1 and vol. 2, Leipzig, Berlin, B. G. Teubner, 1909. %H A000040 W. Liang & H. Yan, Pseudo Random test of prime numbers %H A000040 J. Malkevitch, Primes %H A000040 Mathworld Headline News, Primality Testing is Easy %H A000040 K. Matthews, Generating prime numbers %H A000040 Y. Motohashi, Prime numbers-your gems %H A000040 J. Moyer, Some Prime Numbers %H A000040 C. W. Neville, New Results on Primes from an Old Proof of Euler's %H A000040 L. C. Noll, Prime numbers, Mersenne Primes, Perfect Numbers, etc. %H A000040 J. J. O'Connor & E. F. Robertson, Prime Numbers %H A000040 M. Ogihara & S. Radziszowski, Agrawal-Kayal-Saxena Algorithm for Testing Primality in Polynomial Time %H A000040 P. Papaphilippou, Plotter of prime numbers frequency graph (flash object) [From Philippos Papaphilippou (philippos(AT)safe-mail.net), Jun 02 2010] %H A000040 J. M. Parganin, Primes less than 50000 %H A000040 I. Peterson, Prime Pursuits %H A000040 O. E. Pol, Numeros primos %H A000040 O. E. Pol, Illustration of initial terms. %H A000040 Primefan, The First 500 Prime Numbers %H A000040 Primefan, Script to Calculate Prime Numbers %H A000040 Project Gutenberg Etext, First 100,000 Prime Numbers %H A000040 C. D. Pruitt, Formulae for Generating All Prime Numbers %H A000040 R. Ramachandran, Frontline 19 (17) 08-2000, A Prime Solution %H A000040 W. S. Renwick, EDSAC log. %H A000040 F. Richman, Generating primes by the sieve of Eratosthenes %H A000040 J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers %H A000040 S. M. Ruiz and J. Sondow, Formulas for pi(n) and the n-th prime. %H A000040 S. O. S. Math, First 1000 Prime Numbers %H A000040 A. Schulman, Prime Number Calculator %H A000040 M. Slone, PlanetMath.Org, First thousand positive prime numbers %H A000040 A. Stiglic, The PRIMES is in P little FAQ %H A000040 Tomas Svoboda, List of primes up to 10^6 [Slow link] %H A000040 J. Teitelbaum, Review of "Prime numbers:A computational perspective" by R.Crandall & C.Pomerance %H A000040 J. Thonnard, Les nombres premiers(Primality check; Closest next prime; Factorizer) %H A000040 J. Tramu, Movie of primes scrolling %H A000040 A. Turpel, Aesthetics of the Prime Sequence %H A000040 G. Villemin's Almanac of Numbers, Primes up to 10000 %H A000040 S. Wagon, Prime Time: Review of "Prime Numbers:A Computational Perspective" by R. Crandall & C. Pomerance %H A000040 M. R. Watkins, unusual and physical methods for finding prime numbers %H A000040 S. Wedeniwski, Primality Tests on Commutator Curves %H A000040 E. Wegrzynowski, Les formules simples qui donnent des nombres premiers en grande quantites %H A000040 Eric Weisstein's World of Mathematics, Prime Number. %H A000040 Eric Weisstein's World of Mathematics, Prime Power %H A000040 Eric Weisstein's World of Mathematics, Almost Prime %H A000040 Eric Weisstein's World of Mathematics, Prime-Generating Polynomial %H A000040 Eric Weisstein's World of Mathematics, Prime Spiral %H A000040 Wikipedia, Prime number %H A000040 G. Xiao, Primes server, Sequential Batches Primes Listing (up to orders not exceeding 10^308) %H A000040 G. Xiao, Numerical Calculator, To display p(n) for n up to 41561, operate on "prime(n)" %H A000040 Zhi-Wei Sun, On functions taking only prime values, J. Number Theory 133(2013), no.8, 2794-2812. %H A000040 Index entries for "core" sequences %F A000040 The prime number theorem is the statement that a(n) ~ n * log n as n -> infinity (Hardy and Wright, page 10). %F A000040 For n >= 2, n*(log n + log log n - 3/2) < a(n); for n >= 20, a(n) < n*(log n + log log n - 1/2). [Rosser and Schoenfeld] %F A000040 For all n, a(n) > n log n. [Rosser] %F A000040 n log(n) + n (log log n - 1) < a(n) < n log n + n log log n for n >= 6 [Dusart, quoted in the Wikipedia article] %F A000040 a(n) = n log n + n log log n + (n/log n)*(log log n - log 2 - 2) + O( n (log log n)^2/ (log n)^2). [Cipoli, quoted in the Wikipedia article] %F A000040 a(n) = 2 + sum_{k=2..floor(2n*log(n)+2)} (1-floor(pi(k)/n)), for n>1, where the formula for pi(k) is given in A000720 (Ruiz and Sondow 2002) - _Jonathan Sondow_, Mar 06 2004 %F A000040 I conjecture that Sum(1/(p(i)*log(p(i)))=Pi/2=1.570796327... Sum(1/(i=1..100000 p(i)*log(p(i)))=1.565585514... It converges very slowly. - _Miklos Kristof_, Feb 12 2007 %F A000040 The last conjecture has been discussed by the math.research newsgroup recently. The sum, which is greater than pi/2, is shown in sequence A137245. [_T. D. Noe_, Jan 13 2009] %F A000040 A000005(a(n))=2; A002033(a(n+1))=1 [_Juri-Stepan Gerasimov_, Oct 17 2009] %F A000040 A001222(a(n))=1. [_Juri-Stepan Gerasimov_, Nov 10 2009] %F A000040 Contribution from _Gary Detlefs_, Sep 10 2010: (Start) %F A000040 Conjecture: %F A000040 a(n) ={n| n! mod n^2 = n(n-1)}, n<>4 %F A000040 a(n) ={n| n!*h(n) mod n = n-1},n<>4, where h(n) = sum(1/k,k=1..n) (End) %F A000040 First 15 primes; a(n) = p + abs(p-3/2) + 1/2, where p = m + int((m-3)/2), and m = n + int((n-2)/8) + int((n-4)/8), 1<=n<=15. [From Timothy Hopper (timothyhopper(AT)hotmail.co.uk), Oct 23 2010] %p A000040 A000040 := n->ithprime(n); [ seq(ithprime(i),i=1..100) ]; %t A000040 Table[ Prime[n], {n, 1, 60} ] %o A000040 (MAGMA) [ n : n in [2..500] | IsPrime(n) ]; %o A000040 (MAGMA) a := func< n | NthPrime(n) >; %o A000040 (PARI) a(n)=if(n<1,0,prime(n)) %o A000040 (SAGE) a = sloane.A000040; print a %o A000040 print a.list(58) # _Jaap Spies_, 2007 %o A000040 (Sage) prime_range(1,300) # _Zerinvary Lajos_, May 27 2009 %o A000040 (Maxima) A000040(n) := block( %o A000040 if n = 1 then return(2), %o A000040 return( next_prime(A000040(n-1))) %o A000040 )$ /* recursive, to be replaced if possible, R. J. Mathar, Feb 27 2012 */ %Y A000040 Cf. A002808, A008578, A006879, A006880, A000720 ("pi"), A001223 (differences between primes). %Y A000040 Sequences listing r-almost primes; that is the n such that A001222(n) = r: this sequence (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), A046312 (r = 9), A046314 (r = 10), A069272 (r = 11), A069273 (r = 12), A069274 (r = 13), A069275 (r = 14), A069276 (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011 %Y A000040 Cf. primes in lexicographic order: A210757, A210758, A210759, A210760, A210761. %Y A000040 Cf. A003558, A179480 (relating to the Quasi-order theorem of Hilton and Pedersen). %K A000040 core,nonn,nice,easy %O A000040 1,1 %A A000040 _N. J. A. Sloane_. %E A000040 Additional links contributed by _Lekraj Beedassy_, Dec 23 2003 %E A000040 Additional comments from _Jonathan Sondow_, Dec 27 2004 # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE oeis-0.3.7/test/data/seq_rsp.txt0000644000000000000000000016215412741217037014770 0ustar0000000000000000# Greetings from The On-Line Encyclopedia of Integer Sequences! http://oeis.org/ Search: seq:5,7,11,13,17 Showing 1-10 of 511 %I A000040 M0652 N0241 %S A000040 2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89, %T A000040 97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179, %U A000040 181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271 %N A000040 The prime numbers. %C A000040 A number n is prime if it is greater than 1 and has no positive divisors except 1 and n. %C A000040 A natural number is prime if and only if it has exactly two (positive) divisors. %C A000040 A prime has exactly one proper positive divisor, 1. %C A000040 The sum of an odd number > 1 (2i+1, i >= 1) of consecutive positive odd numbers centered on the j-th odd number >= 2i+1 (2j+1, j >= i) being (2i+1)*(2j+1) has 2 or more odd prime factors (odd semiprime iff 2i+1 and 2j+1 are primes). - _Daniel Forgues_, Jul 15 2009 %C A000040 The paper by Kaoru Motose starts as follows: "Let q be a prime divisor of a Mersenne number 2^p-1 where p is prime. Then p is the order of 2 (mod q). Thus p is a divisor of q-1 and q>p. This shows that there exist infinitely many prime numbers." - Pieter Moree, Oct 14 2004 %C A000040 1 is not a prime, for if the primes included 1, then the factorization of a natural number n into a product of primes would not be unique, since n = n*1. %C A000040 1 is the empty product (has 0 prime factors) whereas a prime has 1 prime factor (itself). - Daniel Forgues, Jul 23 2009 %C A000040 Prime(n) and pi(n) are inverse functions: A000720(a(n)) = n and a(n) is the least number m such that a(A000720(m)) = a(n). a(A000720(n)) = n if (and only if) n is prime. %C A000040 Elementary primality test: If no prime =< sqrt(m) divides m, then m is prime (since a prime is its own exclusive multiple, apart from 1). - _Lekraj Beedassy_, Mar 31 2005 %C A000040 Second sequence ever computed by electronic computer, on EDSAC, May 9 1949 (see Renwick link). - _Russ Cox_, Apr 20 2006 %C A000040 Every prime p is a linear combination of previous primes p(n) with nonzero coefficients c(n) and |c(n)| < p(n). - Amarnath Murthy, Franklin T. Adams-Watters and Joshua Zucker, May 17 2006 %C A000040 Odd primes can only be written as a sum of two consecutive integers. Powers of 2 do not have a representation as a sum of k consecutive integers (other than the trivial n=n, for k=1). See A111774. - _Jaap Spies_, Jan 04 2007 %C A000040 There is a unique decomposition of the primes: provided the weight A117078(n) is > 0, we have prime(n) = weight * level + gap, or A000040(n) = A117078(n) * A117563(n) + A001223(n). - _Rémi Eismann_, Feb 16 2007 %C A000040 Equals row sums of triangle A143350. [_Gary W. Adamson_, Aug 10 2008] %C A000040 APSO (Alternating partial sums of sequence) a-b+c-d+e-f+g... = (a+b+c+d+e+f+g...)-2*(b+d+f...): APSO(A000040) = A008347=A007504 - 2*(A077126 repeated) (A007504-A008347)/2 = A077131 alternated with A077126. - _Eric Desbiaux_, Oct 28 2008 %C A000040 The Greek transliteration of 'Prime Number' is 'Proton Arithmon'. [_Daniel Forgues_, May 08 2009] %C A000040 It appears that, with the Bachet-Bezout theorem, A000040 = (2*A039701)+(3*A157966). - _Eric Desbiaux_, Nov 15 2009 %C A000040 a(n) = A008864(n) - 1 = A052147(n) - 2 = A113395(n) - 3 = A175221(n) - 4 = A175222(n) - 5 = A139049(n) - 6 = A175223(n) - 7 = A175224(n) - 8 = A140353(n) - 9 = A175225(n) - 10. [From _Jaroslav Krizek_, Mar 06 2010] %C A000040 2 and 3 might be referred to as the two "forcibly prime numbers" since there are no integers greater than 1 and less than or equal to their respective square roots. Not a single trial division ever needs to be done for 2 or 3, so they are disqualified from the get go from any attempt to belong to the set of composite numbers. 2 and 3 are thus the only consecutive primes. Since any further prime needs to be coprime to both 2 and 3, they can only be congruent to 5 or 1 (mod 2*3) and thus must all be of the form (2*3)*k -/+ 1 with k >= 1. When both (2*3)*k - 1 and (2*3)*k + 1 are prime for a given k >= 1, they are referred to as twin primes. (3 and 5 being the only twin primes of the form (2*2)*k - 1 and (2*2)*k + 1). - _Daniel Forgues_, Mar 19 2010 %C A000040 For prime n, the sum of divisors of n > product of divisors of n. Sigma(n)==1 (mod n). - _Juri-Stepan Gerasimov_, Mar 12 2011 %C A000040 Conjecture: a(n) = (6*f(n)+(-1)^f(n)-3)/2, n>2, where f(n) = floor(ithprime(n)/3)+1. See A181709. - _Gary Detlefs_, Dec 12 2011 %C A000040 Odd prime p divides some (2^k + 1) or (2^k - 1), (k>0, minimal, Cf. A003558) depending on the parity of A179480((p+1)/2) = r. This is a consequence of the Quasi-order theorem and corollaries, [Hilton and Pederson, pp. 260-264]: 2^k == (-1)^r mod b, b odd; and b divides 2^k - (-1)^r, where p is a subset of b. - _Gary W. Adamson_, Aug 26 2012 %C A000040 A number n is prime if and only if it is different from zero and different from a unit and each multiple of n decomposes into factors such that n divides at least one of the factors. This definition has the advantage that it does not make an assertion on the number of divisors of n. It applies equally for the integers (where a prime has exactly four divisors) and the natural numbers (where a prime has exactly two divisors). - _Peter Luschny_, Oct 09 2012 %C A000040 Motivated by his conjecture on representations of integers by alternating sums of consecutive primes, for any positive integer n, Zhi-Wei Sun conjectured that the polynomial P_n(x)= sum_{k=0}^n a(k+1)*x^k is irreducible over the field of rational numbers with the Galois group S_n, and moreover P_n(x) is irreducible mod a(m) for some m<=n(n+1)/2. It seems that no known criterion on irreduciblity of polynomials implies this conjecture. - _Zhi-Wei Sun_, Mar 23 2013 %D A000040 M. Agrawal, N. Kayal and N. Saxena, PRIMES is in P, Ann. of Math. (2) 160 (2004), no. 2, 781-793. %D A000040 M. Aigner and G. M. Ziegler, Proofs from The Book, Springer-Verlag, Berlin, 2nd. ed., 2001; see p. 3. %D A000040 T. M. Apostol, Introduction to Analytic Number Theory, Springer-Verlag, 1976, page 2. %D A000040 E. Bach and __Jeffrey Shallit__, Algorithmic Number Theory, I, Chaps. 8, 9. %D A000040 P. T. Bateman and H. G. Diamond, A hundred years of prime numbers, Amer. Math. Monthly, Vol. 103 (1996) pp. 729-741. %D A000040 D. M. Bressoud, Factorization and Primality Testing, Springer-Verlag NY 1989. %D A000040 C. K. Caldwell and Y. Xiong, What is the smallest prime?, J. Integer Seq. 15 (2012), no. 9, Article 12.9.7, 14 pp., arXiv:1209.2007, 2012. - From _N. J. A. Sloane_, Dec 26 2012 %D A000040 M. Cipolla, "La determinazione asintotica dell'n-mo numero primo.", Rend. d. R. Acc. di sc. fis. e mat. di Napoli, s. 3, VIII (1902), pp. 132-166. %D A000040 R. Crandall and C. Pomerance, Prime Numbers: A Computational Perspective, Springer, NY, 2001; see p. 1. %D A000040 J.-P. Delahaye, Merveilleux nombres premiers, Pour la Science-Belin Paris, 2000. %D A000040 J.-P. Delahaye, Savoir si un nombre est premier: facile, Pour La Science, 303(1) 2003, pp. 98-102. %D A000040 M. Dietzfelbinger, Primality Testing in Polynomial Time, Springer NY 2004. %D A000040 U. Dudley, Formulas for primes, Math. Mag., 56 (1983), 17-22. %D A000040 Pierre Dusart, Autour de la fonction qui compte le nombre de nombres premiers, Dissertation, Universite de Limoges (1998). %D A000040 Pierre Dusart, The k-th prime is greater than k(ln k + ln ln k-1) for k>=2, Mathematics of Computation 68: (1999), 411-415. %D A000040 J. Elie, "L'algorithme AKS", in 'Quadrature', No. 60, pp. 22-32, 2006 EDP-sciences, Les Ulis (France); %D A000040 Seymour. B. Elk, "Prime Number Assignment to a Hexagonal Tessellation of a Plane That Generates Canonical Names for Peri-Condensed Polybenzenes", J. Chem. Inf. Comput. Sci., vol. 34 (1994), pp. 942-946. %D A000040 W. & F. Ellison, Prime Numbers, Hermann Paris 1985 %D A000040 T. Estermann, Introduction to Modern Prime Number Theory, Camb. Univ. Press, 1969. %D A000040 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 2. %D A000040 Peter Hilton and Jean Pedersen, A Mathematical Tapestry: Demonstrating the Beautiful Unity of Mathematics, Cambridge University Press, 2010, pp. (260-264). %D A000040 H. D. Huskey, Derrick Henry Lehmer [1905-1991]. IEEE Ann. Hist. Comput. 17 (1995), no. 2, 64-68. Math. Rev. 96b:01035 %D A000040 M. N. Huxley, The Distribution of Prime Numbers, Oxford Univ. Press, 1972. %D A000040 D. S. Jandu, Prime Numbers And Factorization, Infinite Bandwidth Publishing, N. Hollywood CA 2007. %D A000040 E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, Chelsea, NY, 1974. %D A000040 D. H. Lehmer, The sieve problem for all-purpose computers. Math. Tables and Other Aids to Computation, Math. Tables and Other Aids to Computation, 7, (1953). 6-14. Math. Rev. 14:691e %D A000040 D. N. Lehmer, "List of Prime Numbers from 1 to 10,006,721", Carnegie Institute, Washington, D.C. 1909. %D A000040 W. J. LeVeque, Topics in Number Theory. Addison-Wesley, Reading, MA, 2 vols., 1956, Vol. 1, Chap. 6. %D A000040 H. Lifchitz, Table Des nombres Premiers de 0 a 20 millions (Tomes I & II), Albert Blanchard, Paris 1971. %D A000040 R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: their history and some applications. Nieuw Arch. Wisk. (4) 13 (1995), no. 1, 113-139. Math. Rev. 96m:11082 %D A000040 Kaoru Motose, On values of cyclotomic polynomials. II, Math. J. Okayama Univ. 37 (1995), 27-36. %D A000040 P. Ribenboim, The New Book of Prime Number Records, Springer-Verlag NY 1995. %D A000040 P. Ribenboim, The Little Book of Bigger Primes, Springer-Verlag NY 2004. %D A000040 H. Riesel, Prime Numbers and Computer Methods for Factorization, Birkhaeuser Boston, Cambridge MA 1994. %D A000040 B. Rittaud, "31415879. Ce nombre est-il premier?" ['Is this number prime?'], La Recherche, Vol. 361, pp. 70-73, Feb 15 2003, Paris. %D A000040 J. Barkley Rosser, Explicit Bounds for Some Functions of Prime Numbers, American Journal of Mathematics 63 (1941) 211-232. %D A000040 M. du Sautoy, The Music of the Primes, Fourth Estate / HarperCollins, 2003; see p. 5. %D A000040 D. Shanks, Solved and Unsolved Problems in Number Theory, 2nd. ed., Chelsea, 1978, Chap. 1. %D A000040 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A000040 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A000040 D. Wells, Prime Numbers:The Most Mysterious Figures In Math, J.Wiley NY 2005. %D A000040 H. C. Williams and __Jeffrey Shallit__, Factoring integers before computers. Mathematics of Computation 1943-1993: a half-century of computational mathematics (Vancouver, BC, 1993), 481-531, Proc. Sympos. Appl. Math., 48, AMS, Providence, RI, 1994. Math. Rev. 95m:11143 %H A000040 N. J. A. Sloane, Table of n, prime(n) for n = 1..10000 %H A000040 N. J. A. Sloane, Table of n, prime(n) for n = 1..100000 %H A000040 M. Agrawal, N. Kayal & N. Saxena, PRIMES is in P, Annals of Maths., 160:2 (2004), pp. 781-793. [alternate link] %H A000040 M. Agrawal, A Short History of "PRIMES is in P" %H A000040 P. Alfeld, Notes and Literature on Prime Numbers %H A000040 Anonymous, Prime Number Master Index (for primes up to 2*10^7) %H A000040 Anonymous, prime number %H A000040 D. J. Bernstein, Proving Primality After Agrawal-Kayal-Saxena %H A000040 D. J. Bernstein, Distinguishing prime numbers from composite numbers %H A000040 P. Berrizbeitia, Sharpening "Primes is in P" for a large family of numbers %H A000040 A. Booker, The Nth Prime Page %H A000040 F. Bornemann, PRIMES Is in P:A Breakthrough for "Everyman" %H A000040 A. Bowyer, Formulae for Primes %H A000040 B. M. Bredikhin, Prime number %H A000040 R. P. Brent, Primality testing and integer factorization %H A000040 J. Britton, Prime Number List %H A000040 D. Butler, The first 2000 Prime Numbers %H A000040 C. K. Caldwell, The Prime Pages %H A000040 C. K. Caldwell, Tables of primes %H A000040 C. K. Caldwell, The first 10000 primes %H A000040 C. K. Caldwell, A Primality Test %H A000040 C. K. Caldwell and Y. Xiong, What is the smallest prime? %H A000040 M. Chamness, Prime number generator (Applet) %H A000040 P. Cox, Primes is in P %H A000040 P. J. Davis & R. Hersh, The Mathematical Experience, The Prime Number Theorem %H A000040 J.-M. De Koninck, Les nombres premiers: mysteres et consolation %H A000040 J.-M. De Koninck, Nombres premiers: mysteres et enjeux %H A000040 J.-P. Delahaye, Formules et nombres premiers %H A000040 J. Elie, L'algorithme AKS ou Les nombres premiers sont de classe P %H A000040 L. Euler, Observations on a theorem of Fermat and others on looking at prime numbers %H A000040 W. Fendt, Table of Primes from 1 to 1000000000000 %H A000040 P. Flajolet, S. Gerhold and B. Salvy, On the non-holonomic character of logarithms, powers and the n-th prime function %H A000040 J. Flamant, Primes up to one million %H A000040 K. Ford, Expositions of the PRIMES is in P theorem. %H A000040 L. & Y. Gallot, The Chronology of Prime Number Records %H A000040 P. Garrett, Big Primes, Factoring Big Integers %H A000040 P. Garrett, Naive Primality Test %H A000040 P. Garrett, Listing Primes %H A000040 N. Gast, PRIMES is in P: Manindra Agrawal, Neeraj Kayal and Nitin Saxena (in French) %H A000040 D. A. Goldston, S. W. Graham, J. Pintz and C. Y. Yildirim, Small gaps between primes and almost primes %H A000040 A. Granville, It is easy to determine whether a given integer is prime [alternate link] %H A000040 P. Hartmann, Prime number proofs (in German) %H A000040 ICON Project, List of first 50000 primes grouped within ten columns %H A000040 N. Kayal & N. Saxena, Resonance 11-2002, A polynomial time algorithm to test if a number is prime or not %H A000040 E. Landau, Handbuch der Lehre von der Verteilung der Primzahlen, vol. 1 and vol. 2, Leipzig, Berlin, B. G. Teubner, 1909. %H A000040 W. Liang & H. Yan, Pseudo Random test of prime numbers %H A000040 J. Malkevitch, Primes %H A000040 Mathworld Headline News, Primality Testing is Easy %H A000040 K. Matthews, Generating prime numbers %H A000040 Y. Motohashi, Prime numbers-your gems %H A000040 J. Moyer, Some Prime Numbers %H A000040 C. W. Neville, New Results on Primes from an Old Proof of Euler's %H A000040 L. C. Noll, Prime numbers, Mersenne Primes, Perfect Numbers, etc. %H A000040 J. J. O'Connor & E. F. Robertson, Prime Numbers %H A000040 M. Ogihara & S. Radziszowski, Agrawal-Kayal-Saxena Algorithm for Testing Primality in Polynomial Time %H A000040 P. Papaphilippou, Plotter of prime numbers frequency graph (flash object) [From Philippos Papaphilippou (philippos(AT)safe-mail.net), Jun 02 2010] %H A000040 J. M. Parganin, Primes less than 50000 %H A000040 I. Peterson, Prime Pursuits %H A000040 O. E. Pol, Numeros primos %H A000040 O. E. Pol, Illustration of initial terms. %H A000040 Primefan, The First 500 Prime Numbers %H A000040 Primefan, Script to Calculate Prime Numbers %H A000040 Project Gutenberg Etext, First 100,000 Prime Numbers %H A000040 C. D. Pruitt, Formulae for Generating All Prime Numbers %H A000040 R. Ramachandran, Frontline 19 (17) 08-2000, A Prime Solution %H A000040 W. S. Renwick, EDSAC log. %H A000040 F. Richman, Generating primes by the sieve of Eratosthenes %H A000040 J. Barkley Rosser and Lowell Schoenfeld, Approximate formulas for some functions of prime numbers %H A000040 S. M. Ruiz and J. Sondow, Formulas for pi(n) and the n-th prime. %H A000040 S. O. S. Math, First 1000 Prime Numbers %H A000040 A. Schulman, Prime Number Calculator %H A000040 M. Slone, PlanetMath.Org, First thousand positive prime numbers %H A000040 A. Stiglic, The PRIMES is in P little FAQ %H A000040 Tomas Svoboda, List of primes up to 10^6 [Slow link] %H A000040 J. Teitelbaum, Review of "Prime numbers:A computational perspective" by R.Crandall & C.Pomerance %H A000040 J. Thonnard, Les nombres premiers(Primality check; Closest next prime; Factorizer) %H A000040 J. Tramu, Movie of primes scrolling %H A000040 A. Turpel, Aesthetics of the Prime Sequence %H A000040 G. Villemin's Almanac of Numbers, Primes up to 10000 %H A000040 S. Wagon, Prime Time: Review of "Prime Numbers:A Computational Perspective" by R. Crandall & C. Pomerance %H A000040 M. R. Watkins, unusual and physical methods for finding prime numbers %H A000040 S. Wedeniwski, Primality Tests on Commutator Curves %H A000040 E. Wegrzynowski, Les formules simples qui donnent des nombres premiers en grande quantites %H A000040 Eric Weisstein's World of Mathematics, Prime Number. %H A000040 Eric Weisstein's World of Mathematics, Prime Power %H A000040 Eric Weisstein's World of Mathematics, Almost Prime %H A000040 Eric Weisstein's World of Mathematics, Prime-Generating Polynomial %H A000040 Eric Weisstein's World of Mathematics, Prime Spiral %H A000040 Wikipedia, Prime number %H A000040 G. Xiao, Primes server, Sequential Batches Primes Listing (up to orders not exceeding 10^308) %H A000040 G. Xiao, Numerical Calculator, To display p(n) for n up to 41561, operate on "prime(n)" %H A000040 Zhi-Wei Sun, On functions taking only prime values, J. Number Theory 133(2013), no.8, 2794-2812. %H A000040 Index entries for "core" sequences %F A000040 The prime number theorem is the statement that a(n) ~ n * log n as n -> infinity (Hardy and Wright, page 10). %F A000040 For n >= 2, n*(log n + log log n - 3/2) < a(n); for n >= 20, a(n) < n*(log n + log log n - 1/2). [Rosser and Schoenfeld] %F A000040 For all n, a(n) > n log n. [Rosser] %F A000040 n log(n) + n (log log n - 1) < a(n) < n log n + n log log n for n >= 6 [Dusart, quoted in the Wikipedia article] %F A000040 a(n) = n log n + n log log n + (n/log n)*(log log n - log 2 - 2) + O( n (log log n)^2/ (log n)^2). [Cipoli, quoted in the Wikipedia article] %F A000040 a(n) = 2 + sum_{k=2..floor(2n*log(n)+2)} (1-floor(pi(k)/n)), for n>1, where the formula for pi(k) is given in A000720 (Ruiz and Sondow 2002) - _Jonathan Sondow_, Mar 06 2004 %F A000040 I conjecture that Sum(1/(p(i)*log(p(i)))=Pi/2=1.570796327... Sum(1/(i=1..100000 p(i)*log(p(i)))=1.565585514... It converges very slowly. - _Miklos Kristof_, Feb 12 2007 %F A000040 The last conjecture has been discussed by the math.research newsgroup recently. The sum, which is greater than pi/2, is shown in sequence A137245. [_T. D. Noe_, Jan 13 2009] %F A000040 A000005(a(n))=2; A002033(a(n+1))=1 [_Juri-Stepan Gerasimov_, Oct 17 2009] %F A000040 A001222(a(n))=1. [_Juri-Stepan Gerasimov_, Nov 10 2009] %F A000040 Contribution from _Gary Detlefs_, Sep 10 2010: (Start) %F A000040 Conjecture: %F A000040 a(n) ={n| n! mod n^2 = n(n-1)}, n<>4 %F A000040 a(n) ={n| n!*h(n) mod n = n-1},n<>4, where h(n) = sum(1/k,k=1..n) (End) %F A000040 First 15 primes; a(n) = p + abs(p-3/2) + 1/2, where p = m + int((m-3)/2), and m = n + int((n-2)/8) + int((n-4)/8), 1<=n<=15. [From Timothy Hopper (timothyhopper(AT)hotmail.co.uk), Oct 23 2010] %p A000040 A000040 := n->ithprime(n); [ seq(ithprime(i),i=1..100) ]; %t A000040 Table[ Prime[n], {n, 1, 60} ] %o A000040 (MAGMA) [ n : n in [2..500] | IsPrime(n) ]; %o A000040 (MAGMA) a := func< n | NthPrime(n) >; %o A000040 (PARI) a(n)=if(n<1,0,prime(n)) %o A000040 (SAGE) a = sloane.A000040; print a %o A000040 print a.list(58) # _Jaap Spies_, 2007 %o A000040 (Sage) prime_range(1,300) # _Zerinvary Lajos_, May 27 2009 %o A000040 (Maxima) A000040(n) := block( %o A000040 if n = 1 then return(2), %o A000040 return( next_prime(A000040(n-1))) %o A000040 )$ /* recursive, to be replaced if possible, R. J. Mathar, Feb 27 2012 */ %Y A000040 Cf. A002808, A008578, A006879, A006880, A000720 ("pi"), A001223 (differences between primes). %Y A000040 Sequences listing r-almost primes; that is the n such that A001222(n) = r: this sequence (r = 1), A001358 (r = 2), A014612 (r = 3), A014613 (r = 4), A014614 (r = 5), A046306 (r = 6), A046308 (r = 7), A046310 (r = 8), A046312 (r = 9), A046314 (r = 10), A069272 (r = 11), A069273 (r = 12), A069274 (r = 13), A069275 (r = 14), A069276 (r = 15), A069277 (r = 16), A069278 (r = 17), A069279 (r = 18), A069280 (r = 19), A069281 (r = 20). - Jason Kimberley, Oct 02 2011 %Y A000040 Cf. primes in lexicographic order: A210757, A210758, A210759, A210760, A210761. %Y A000040 Cf. A003558, A179480 (relating to the Quasi-order theorem of Hilton and Pedersen). %K A000040 core,nonn,nice,easy %O A000040 1,1 %A A000040 _N. J. A. Sloane_. %E A000040 Additional links contributed by _Lekraj Beedassy_, Dec 23 2003 %E A000040 Additional comments from _Jonathan Sondow_, Dec 27 2004 %I A008578 %S A008578 1,2,3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83, %T A008578 89,97,101,103,107,109,113,127,131,137,139,149,151,157,163,167,173, %U A008578 179,181,191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271 %N A008578 Prime numbers at the beginning of the 20th century (today 1 is no longer regarded as a prime). %C A008578 The noncomposite numbers. %C A008578 Also smallest sequence with the property that the product of 2 or more elements with different indices is never a square. - Ulrich Schimke (ulrschimke(AT)aol.com), Dec 12 2001 %C A008578 Numbers n such that their largest divisor <= sqrt(n) equals 1. (See also A161344, A161345, A161424). [From Omar E. Pol, Jul 05 2009] %C A008578 Or numbers n with only perfect partition; also numbers such that 1=number of perfect partitions of n; or, unit together with the prime numbers A000040. [From _Juri-Stepan Gerasimov_, Sep 27 2009] %C A008578 Numbers n such that d(n) < 3. [From _Juri-Stepan Gerasimov_, Oct 17 2009] %C A008578 Also first column of array in A163280. Also first row of array in A163990. - Omar E. Pol, Oct 24 2009 %C A008578 a(n) = possible values of A136548(m) in increasing order, where A136548(m) = the largest numbers h such that A000203(h) <= k (k = 1,2,3,..), where A000203(h) = sum of divisors of h. [From _Jaroslav Krizek_, Mar 01 2010] %C A008578 Where record values of A022404 occur: A086332(n)=A022404(a(n)). [From _Reinhard Zumkeller_, Jun 21 2010] %C A008578 a(n) = A181363((2*n-1)*2^k), k >= 0. [From _Reinhard Zumkeller_, Oct 16 2010] %C A008578 1 together with the prime numbers. - Omar E. Pol, Mar 04 2011 %C A008578 A060448(a(n)) = 1. [_Reinhard Zumkeller_, Apr 05 2012] %C A008578 Positive integers that have no divisors other than 1 and itself (the old definition of prime numbers). - _Omar E. Pol_, Aug 10 2012 %C A008578 A086971(a(n)) = 0. - _Reinhard Zumkeller_, Dec 14 2012 %C A008578 Conjecture: the sequence contains exactly those n such that sigma(n) > n*BigOmega(n). - _Irina Gerasimova_, Jun 08 2013 %C A008578 Note on the Gerasimova conjecture: all members in the sequence obviously satisfy the inequality, because sigma(p) = 1+p and BigOmega(p) = 1 for primes p, so 1+p > p*1. For composites, the (opposite) inequality is heuristically correct at least up to n <= 4400000. The general proof requires to show that BigOmega(n) is an upper limit of the abundancy sigma(n)/n for composite n. This proof is easy for semiprimes n=p1*p2 in general, where sigma(n)=1+p1+p2+p1*p2 and BigOmega(n)=2 and p1, p2 <= 2. - _R. J. Mathar_, Jun 12 2013 %D A008578 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards Applied Math. Series 55, 1964 (and various reprintings), p. 870. %D A008578 C. K. Caldwell and Y. Xiong, What is the smallest prime?, arXiv preprint arXiv:1209.2007, 2012. - From _N. J. A. Sloane_, Dec 26 2012 %D A008578 G. Chrystal, Algebra: An Elementary Textbook. Chelsea Publishing Company, 7th edition, (1964), chap. III.7, p. 38. %D A008578 G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers. 3rd ed., Oxford Univ. Press, 1954, p. 11. %D A008578 H. D. Huskey, Derrick Henry Lehmer [1905-1991]. IEEE Ann. Hist. Comput. 17 (1995), no. 2, 64-68. Math. Rev. 96b:01035 %D A008578 D. H. Lehmer, The sieve problem for all-purpose computers. Math. Tables and Other Aids to Computation, Math. Tables and Other Aids to Computation, 7, (1953). 6-14. Math. Rev. 14:691e %D A008578 D. N. Lehmer, "List of Prime Numbers from 1 to 10,006,721", Carnegie Institute, Washington, D.C. 1909. %D A008578 R. F. Lukes, C. D. Patterson and H. C. Williams, Numerical sieving devices: their history and some applications. Nieuw Arch. Wisk. (4) 13 (1995), no. 1, 113-139. Math. Rev. 96m:11082 %D A008578 A. Reddick and Y. Xiong, The search for one as a prime number: from ancient Greece to modern times, Electronic Journal of Undergraduate Mathematics, Volume 16, 1 { 13, 2012. - From _N. J. A. Sloane_, Feb 03 2013 %D A008578 Williams, H. C.; Shallit, J. O. Factoring integers before computers. Mathematics of Computation 1943-1993: a half-century of computational mathematics (Vancouver, BC, 1993), 481-531, Proc. Sympos. Appl. Math., 48, AMS, Providence, RI, 1994. Math. Rev. 95m:11143 %H A008578 Charles R Greathouse IV, Table of n, a(n) for n = 1..10000 %H A008578 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972 [alternative scanned copy] %H A008578 G. P. Michon, Is 1 a prime number? %H A008578 O. E. Pol, Illustration of initial terms %H A008578 O. E. Pol, Illustration of initial terms of A008578, A161344, A161345, A161424 %H A008578 PrimeFan, Arguments for and against the primality of 1 %H A008578 J. Todd, Review of Lehmer's tables, Mathematical Tables and Other Aids.., Vol. 11, No. 60, (1957) (on JSTOR.org). %H A008578 Wikipedia, Dirichlet convolution %F A008578 m is in the sequence iff sigma(m)+phi(m)=2m. - _Farideh Firoozbakht_, Jan 27 2005 %F A008578 a(n) = A158611(n+1) for n >= 1. [From _Jaroslav Krizek_, Jun 19 2009] %F A008578 In the following formulas (based on emails from Jaroslav Krizek and R. J. Mathar), the star denotes a Dirichlet convolution between two sequences, and "This" is A008578. %F A008578 This = A030014 * A008683. (Dirichlet convolution using offset 1 with A030014) %F A008578 This = A030013 * A000012. (Dirichlet convolution using offset 1 with A030013) %F A008578 This = A034773 * A007427. (Dirichlet convolution) %F A008578 This = A034760 * A023900. (Dirichlet convolution) %F A008578 This = A034762 * A046692. (Dirichlet convolution) %F A008578 This * A000012 = A030014. (Dirichlet convolution using offset 1 with A030014) %F A008578 This * A008683 = A030013. (Dirichlet convolution using offset 1 with A030013) %F A008578 This * A000005 = A034773. (Dirichlet convolution) %F A008578 This * A000010 = A034760. (Dirichlet convolution) %F A008578 This * A000203 = A034762. (Dirichlet convolution) %F A008578 A002033(a(n))=1. [From _Juri-Stepan Gerasimov_, Sep 27 2009] %F A008578 A033273(a(n))=1 [From Juri-Stepan(AT)rambler.ru (2stepan(AT)rambler.ru), Dec 07 2009] %F A008578 a(n) = A001747(n)/2. - Omar E. Pol, Jan 30 2012 %p A008578 A008578 := n->if n=1 then 1 else ithprime(n-1); fi : %t A008578 Join[ {1}, Table[ Prime[n], {n, 1, 60} ] ] %o A008578 (PARI) is(n)=isprime(n)||n==1 %o A008578 (MAGMA) [1] cat [n: n in PrimesUpTo(271)]; // Bruno Berselli, Mar 05 2011 %o A008578 (Haskell) %o A008578 a008578 n = a008578_list !! (n-1) %o A008578 a008578_list = 1 : a000040_list %o A008578 -- _Reinhard Zumkeller_, Nov 09 2011 %Y A008578 Main entry for this sequence is A000040. The complement of A002808. %K A008578 nonn,easy,nice %O A008578 1,2 %A A008578 _N. J. A. Sloane_. %I A001097 %S A001097 3,5,7,11,13,17,19,29,31,41,43,59,61,71,73,101,103,107,109,137,139, %T A001097 149,151,179,181,191,193,197,199,227,229,239,241,269,271,281,283,311, %U A001097 313,347,349,419,421,431,433,461,463,521,523,569,571,599,601,617,619,641,643 %N A001097 Twin primes. %C A001097 Union of A001359 and A006512. %C A001097 The only twin primes that are Fibonacci numbers are 3, 5 and 13 [MacKinnon]. - Emeric Deutsch, Apr 24 2005 %C A001097 (p, p+2) are twin primes if and only if p + 2 can be represented as the sum of two primes. Brun (1919): Even if there are infinitely many twin primes, the series of all twin prime reciprocals does converges against Brun's constant (A065421). Clement (1949): (n, n+2) are twin primes if and only if (4*(n-1)!+n+4) mod n(n+2) = 0. - _Stefan Steinerberger_, Dec 04 2005 %C A001097 A164292(a(n)) = 1. [From _Reinhard Zumkeller_, Mar 29 2010] %C A001097 The 100355-digit numbers, 65516468355 · 2^333333 +/- 1, are currently the largest known twin primes. They were discovered by Twin Prime Search and Primegrid in August 2009. - Paul Muljadi, Mar 07 2011 %D A001097 Harvey Dubner, Twin Prime Statistics, Journal of Integer Sequences, Vol. 8 (2005), Article 05.4.2. %D A001097 N. MacKinnon, Problem 10844, Amer. Math. Monthly 109, (2002), p. 78. %D A001097 P. Ribenboim, The New Book of Prime Number Records, Springer-Verlag, p. 259-265. %H A001097 T. D. Noe, Table of n, a(n) for n = 1..10000 %H A001097 M. Abramowitz and I. A. Stegun, eds., Handbook of Mathematical Functions, National Bureau of Standards, Applied Math. Series 55, Tenth Printing, 1972, p. 870. %H A001097 J. P. Delahaye, Twin Primes:Enemy Brothers? %H A001097 Eric Weisstein's World of Mathematics, Twin Primes %H A001097 Index entries for primes, gaps between %H A001097 O. E. Pol, Determinacion geometrica de los numeros primos y perfectos. %t A001097 Select[ Prime[ Range[120]], PrimeQ[ # - 2] || PrimeQ[ # + 2] &] (* _Robert G. Wilson v_, Jun 09 2005 *) %o A001097 (PARI) isA001097(n) = (isprime(n) & (isprime(n+2) | isprime(n-2))) \\ _Michael B. Porter_, Oct 29 2009 %o A001097 (PARI) a(n)=if(n==1,return(3));my(p);forprime(q=3,default(primelimit), if(q-p==2 && (n-=2)<0, return(if(n==-1,q,p)));p=q) \\ _Charles R Greathouse IV_, Aug 22 2012 %o A001097 (Haskell) %o A001097 a001097 n = a001097_list !! (n-1) %o A001097 a001097_list = head a077800_list : drop 2 a077800_list %o A001097 -- _Reinhard Zumkeller_, Nov 27 2011 %Y A001097 Cf. A070076. See A077800 for another version. %K A001097 nonn,core %O A001097 1,1 %A A001097 _N. J. A. Sloane_. %E A001097 More terms from _James A. Sellers_, Sep 19 2000 %I A007310 %S A007310 1,5,7,11,13,17,19,23,25,29,31,35,37,41,43,47,49,53,55,59,61,65,67,71, %T A007310 73,77,79,83,85,89,91,95,97,101,103,107,109,113,115,119,121,125,127, %U A007310 131,133,137,139,143,145,149 %N A007310 Numbers congruent to 1 or 5 mod 6. %C A007310 Or, numbers relatively prime to 2 and 3. %C A007310 Apart from initial term(s), dimension of the space of weight 2n cuspidal newforms for Gamma_0( 38 ). %C A007310 Numbers k such that k mod 2 = 1 and (k+1) mod 3 <> 1. - _Klaus Brockhaus_, Jun 15 2004 %C A007310 Also numbers n such that the sum of the squares of the first n integers is divisible by n, or A000330(n) = n(n+1)(2n+1)/6 is divisible by n. - _Alexander Adamchuk_, Jan 04 2007 %C A007310 Or, except for the first term, numbers the least prime factor of which is >=5. - _Zak Seidov_, Apr 26 2007 %C A007310 A126759(a(n)) = n+1. - _Reinhard Zumkeller_, Jun 16 2008 %C A007310 Terms of this sequence (starting from the second term) are equal to the result of the expression sqrt(4!*(k+1) + 1) - but only when this expression yields integral values (that is when the parameter k takes values, which are terms of A144065) [From _Alexander R. Povolotsky_, Sep 09 2008] %C A007310 For n>1: a(n) is prime iff A075743(n-2) = 1; a(2*n-1)=A016969(n-1), a(2*n)=A016921(n-1). [From _Reinhard Zumkeller_, Oct 02 2008] %C A007310 A156543 is a subsequence. [From _Reinhard Zumkeller_, Feb 10 2009] %C A007310 Also the 5-rough numbers: positive integers that have no prime factors less than 5 [From _Michael B. Porter_, Oct 09 2009] %C A007310 Numbers n such that ChebyshevT[x, x/2] is not an integer (is integer/2). [From _Artur Jasinski_, Feb 13 2010] %C A007310 If 12k+1 is a perfect square..(0,2,4,10,14,24,30,44...) then the square root of 12k+1 = a(n) [From _Gary Detlefs_, Feb 22 2010] %C A007310 A089128(a(n)) = 1. Complement of A047229(n+1) for n>=1. See A164576 for corresponding values A175485(a(n)). [From _Jaroslav Krizek_, May 28 2010] %C A007310 Cf. property described by G. Detlefs in A113801 and in Comment: more generally, these numbers are of the form (2*h*n+(h-4)*(-1)^n-h)/4 (h, n natural numbers), therefore ((2*h*n+(h-4)*(-1)^n-h)/4)^2-1==0 (mod h); in this case, a(n)^2-1==0 (mod 6). Also a(n)^2-1==0 (mod 12). [_Bruno Berselli_, Nov 05 2010 - Nov 17 2010] %C A007310 Numbers n such that sum(k^14,k=1..n) mod n = 0. (Conjectured) [From Gary Detlefs, Dec 27, 2011] %C A007310 A126759(a(n)) = n and A126759(m) < n for m < a(n). - _Reinhard Zumkeller_, May 23 2013 %C A007310 (a(n)^2 -1)/24 = A001318(n), the Generalized Pentagonal Numbers. _Richard R. Forberg_ May 30, 2013 %D A007310 L. B. W. Jolley, "Summation of Series", Dover Publications, 1961. %H A007310 _Reinhard Zumkeller_, Table of n, a(n) for n = 1..10000 %H A007310 R. J. Cano, b-file generator written in C. %H A007310 William A. Stein, Dimensions of the spaces S_k^{new}(Gamma_0(N)) %H A007310 William A. Stein, The modular forms database %H A007310 Eric Weisstein's World of Mathematics, Rough Number %H A007310 Eric Weisstein, Pi Formulas [From _Jaume Oliver Lafont_, Oct 23 2009] %H A007310 Index entries for sequences related to smooth numbers [From _Michael B. Porter_, Oct 09 2009] %H A007310 Index entries for sequences related to linear recurrences with constant coefficients, signature (1,1,-1). %F A007310 a(n) = (6n + (-1)^n - 3)/2. - Antonio Esposito (antonio.b.esposito(AT)italtel.it), Jan 18 2002 %F A007310 n such that phi(4n) = phi(3n). - _Benoit Cloitre_, Aug 06 2003 %F A007310 a(n) = a(n-1) + a(n-2) - a(n-3), n>=4. - _Roger Bagula_ %F A007310 a(n) = 3n-1-(n mod 2), n=1, 2, ... - Zak Seidov, Jan 18 2006 %F A007310 a(1) = 1 then alternatively add 4 and 2. a(1)=1, a(n)=a(n-1)+3+(-1)^n. - _Zak Seidov_, Mar 25 2006 %F A007310 1 + 1/5^2 + 1/7^2 + 1/11^2 + ...= Pi^2/9 [Jolley] - _Gary W. Adamson_, Dec 20 2006 %F A007310 For n>=3 a(n) = a(n-2)+6. - _Zak Seidov_, Apr 18 2007 %F A007310 Expand (x+x^5)/(1-x^6) = x +x^5 +x^7 +x^11 +x^13+... O.g.f.: x(1+4x+x^2)/((1+x)(1-x)^2). - _R. J. Mathar_, May 23 2008 %F A007310 a(n) = 6*floor(n/2) - 1 + 2*(n mod 2). - _Reinhard Zumkeller_, Oct 02 2008 %F A007310 1 + 1/5 - 1/7 - 1/11 + + - - ... = Pi/3 = A019670 [Jolley eq (315)]. - _Jaume Oliver Lafont_, Oct 23 2009 %F A007310 A169611(a(n)) = 0. - _Juri-Stepan Gerasimov_, Dec 03 2009 %F A007310 a(n) = ( 6*A062717(n)+1 )^(1/2). - _Gary Detlefs_, Feb 22 2010 %F A007310 a(n) = 6*A000217(n-1)+1 - 2*sum(a(i), i=1..n-1) (n>1). [From _Bruno Berselli_, Nov 05 2010] %F A007310 a(n) = 6*n-a(n-1)-6 (with a(1)=1). - Vincenzo Librandi, Nov 18 2010 %F A007310 Sum_{n>=1} (-1)^(n+1)/a(n) = A093766 [Jolley eq (84)]. - R. J. Mathar, Mar 24 2011 %F A007310 a(n) = 6*floor(n/2)+(-1)^(n+1). - Gary Detlefs, Dec 29 2011 %F A007310 a(n) = 3*n + ((n+1) mod 2) - 2. - Gary Detlefs, Jan 08 2012 %F A007310 a(n) = 2*n+1 + 2*floor((n-2)/2) = 2*n-1 + 2*floor(n/2), leading to the o.g.f. given by R. J. Mathar above. - Wolfdieter Lang, Jan 20 2012 %F A007310 1 - 1/5 + 1/7 - 1/11 + - ... = Pi*sqrt(3)/6 (L. Euler) - _Philippe Deléham_, Mar 09 2013 %F A007310 1 - 1/5^3 + 1/7^3 - 1/11^3 + - ... = Pi^3*sqrt(3)/54 (L. Euler) - _Philippe Deléham_, Mar 09 2013 %p A007310 P:=(j,n)-> sum(k^j,k=1..n): for n from 1 to 149 do if (P(14,n) mod n = 0) then print(n) fi od; [From Gary Detlefs, Dec 27 2011] %t A007310 aa = {}; Do[If[IntegerQ[ChebyshevT[x, x/2]], , AppendTo[aa, x]], {x, 0, 150}]; aa (*Artur Jasinski*) [From _Artur Jasinski_, Feb 13 2010] %o A007310 (PARI) The following PARI program applies to generate all terms besides first one: j=[];for(n=0, 1000,if((floor(sqrt(4!*(n+1) + 1))) == ceil(sqrt(4!*(n+1) + 1)), j=concat(j,floor(sqrt(4!*(n+1) + 1))))); j [From _Alexander R. Povolotsky_, Sep 09 2008] %o A007310 (PARI) isA007310(n) = gcd(n,6)==1 [From _Michael B. Porter_, Oct 09 2009] %o A007310 (Sage) [i for i in range(150) if gcd(6,i) == 1] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 21 2009] %o A007310 (Haskell) %o A007310 a007310 n = a007310_list !! (n-1) %o A007310 a007310_list = 1 : 5 : map (+ 6) a007310_list %o A007310 -- _Reinhard Zumkeller_, Jan 07 2012 %o A007310 (C) See Cano Link. %Y A007310 Subsequence of A186422. Union of A016921 and A016969. Essentially the same as A038179. %Y A007310 Cf. A000330, A144065, A047209, A047336, A047522, A056020, A090771, A091998, A175885-A175887, A032528 (partial sums), A047229 (complement), A038509 (subsequence of composites). %Y A007310 For k-rough numbers with other values of k, see A000027, A005408, A007310, A007775, A008364-A008366, A166061, A166063. %K A007310 nonn,easy %O A007310 1,2 %A A007310 C. Christofferson (Magpie56(AT)aol.com) %I A065091 %S A065091 3,5,7,11,13,17,19,23,29,31,37,41,43,47,53,59,61,67,71,73,79,83,89,97, %T A065091 101,103,107,109,113,127,131,137,139,149,151,157,163,167,173,179,181, %U A065091 191,193,197,199,211,223,227,229,233,239,241,251,257,263,269,271,277 %N A065091 Odd primes. %C A065091 Rayes et al. prove that the a(n)-th Chebyshev-T polynomial, divided by x, is irreducible over the integers. %C A065091 Intersection of A005408 and A000040. [From _Reinhard Zumkeller_, Oct 14 2008] %C A065091 Smallest prime>n-th prime. [From _Juri-Stepan Gerasimov_, Oct 29 2009] %C A065091 Primes which are the sum of two consecutive numbers. [From _Juri-Stepan Gerasimov_, Nov 07 2009] %C A065091 Primes==-+1 mod 4. [From _Juri-Stepan Gerasimov_, Apr 27 2010] %C A065091 a(n) = A053670(A179675(n)) and a(n) <> A053670(m) for m < A179675(n). [From _Reinhard Zumkeller_, Jul 23 2010] %C A065091 Triads of the form <2*a(n+1), a(n+1), 3*a(n+1)> like <6,3,9>, <10,5,15>, <14,7,21> appear in the EKG sequence A064413, see Theorem (3) there. - Paul Curtz, Feb 13 2011. %C A065091 Complement of A065090; abs(A151763(a(n))) = 1. [_Reinhard Zumkeller_, Oct 06 2011] %C A065091 Right edge of the triangle in A065305. [_Reinhard Zumkeller_, Jan 30 2012] %C A065091 Numbers with two odd divisors. - Omar E. Pol, Mar 24 2012 %H A065091 Harry J. Smith, Table of n, a(n) for n = 1..1000 %H A065091 M. O. Rayes, V. Trevisan and P. S. Wang, Factorization of Chebyshev Polynomials %H A065091 Eric Weisstein's World of Mathematics, Prime Number. %p A065091 A065091 := proc(n) RETURN(ithprime(n+1)) end: %t A065091 Prime[Range[2, 33]] [From _Vladimir Joseph Stephan Orlovsky_, Aug 22 2008] %o A065091 (PARI) { for (n=1, 1000, write("b065091.txt", n, " ", prime(n + 1)) ) } [From _Harry J. Smith_, Oct 06 2009] %o A065091 (PARI) The program below is supposedly valid for generating primes for n>=3; it is based on the comment in A075888: "For n>=3, prime(n+1)^2-prime(n)^2 is always divisible by 24" j=[];for(n=0, 500, if((floor(sqrt(4!*(n+1) + 1))) == ceil(sqrt(4!*(n+1) + 1)), if(isprime(floor(sqrt(4!*(n+1) + 1))),j=concat(j,floor(sqrt(4!*(n+1) + 1))))));j [From _Alexander R. Povolotsky_, Sep 16 2008] %o A065091 (Haskell) %o A065091 a065091 n = a065091_list !! (n-1) %o A065091 a065091_list = tail a000040_list -- _Reinhard Zumkeller_, Jan 30 2012 %Y A065091 Cf. A000040, A033270. %K A065091 nonn,easy %O A065091 1,1 %A A065091 Labos E. (labos(AT)ana.sote.hu), Nov 12 2001 %E A065091 More terms from Francisco Salinas (franciscodesalinas(AT)hotmail.com), Jan 05 2002 %I A001605 M2309 N0911 %S A001605 3,4,5,7,11,13,17,23,29,43,47,83,131,137,359,431,433,449,509,569,571, %T A001605 2971,4723,5387,9311,9677,14431,25561,30757,35999,37511,50833,81839, %U A001605 104911,130021,148091,201107,397379,433781,590041,593689,604711,931517,1049897,1285607,1636007,1803059,1968721 %N A001605 Indices of prime Fibonacci numbers. %C A001605 Some of the larger entries may only correspond to probable primes. %C A001605 Since F[n] divides F[mn] (cf. A001578, A086597), all terms of this sequence are primes except for a(2)=4 (=2*2 but F[2]=1). - _M. F. Hasler_, Dec 12 2007 %C A001605 What is the next larger twin prime after F(4)=3, F(5)=5, F(7)=11? It seems to be >= F(104911) (greater of a pair?) or even >= F(397379) (lesser of a pair?). - _M. F. Hasler_, Jan 30 2013 %D A001605 J. Brillhart, P. L. Montgomery and R. D. Silverman, Tables of Fibonacci and Lucas factorizations, Math. Comp. 50 (1988), 251-260. %D A001605 H. Dubner and W. Keller, New Fibonacci and Lucas Primes, Math. Comp. 68 (1999) 417-427. %D A001605 C. Pickover, Mazes for the Mind, St. Martin's Press, NY, 1992, p. 350. %D A001605 Clifford A. Pickover, A Passion for Mathematics, Wiley, 2005; see p. 54. %D A001605 P. Ribenboim, The Little Book of Big Primes, Springer-Verlag, NY, 1991, p. 178. %D A001605 N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence). %D A001605 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %H A001605 David Broadhurst, Fibonacci Numbers %H A001605 David Broadhurst, Proof that F(81839) is prime, NMBRTHRY maillist, 22 April 2001 %H A001605 C. K. Caldwell, The Prime Glossary, Fibonacci prime %H A001605 Dudley Fox, Search for Possible Fibonacci Primes %H A001605 R. Knott, Mathematics of the Fibonacci Series %H A001605 Henri & Renaud Lifchitz, PRP Records. %H A001605 Tony D. Noe and Jonathan Vos Post, Primes in Fibonacci n-step and Lucas n-step Sequences, J. of Integer Sequences, Vol. 8 (2005), Article 05.4.4 %H A001605 R. Ondrejka, The Top Ten: a Catalogue of Primal Configurations %H A001605 Eric Weisstein's World of Mathematics, Fibonacci Prime. %H A001605 Eric Weisstein's World of Mathematics, Integer Sequence Primes. %F A001605 Prime(i) = a(n) for some n <=> A080345(i) <= 1. - _M. F. Hasler_, Dec 12 2007 %t A001605 lst={};Do[f=Fibonacci[n];If[PrimeQ[f], AppendTo[lst, n]], {n, 1, 10^4}];lst [From _Vladimir Joseph Stephan Orlovsky_, Aug 14 2008] %t A001605 Select[Range[2000000],PrimeQ[Fibonacci[#]]&] (* _Harvey P. Dale_, Nov 20 2012 *) %o A001605 (PARI) v=[3,4]; forprime(p=5,1e5, if(ispseudoprime(fibonacci(p)), v=concat(v,p))); v \\ _Charles R Greathouse IV_, Feb 14 2011 %o A001605 (PARI) is_A001605(n)={n==4 || isprime(n) & ispseudoprime(fibonacci(n))} \\ - _M. F. Hasler_, Sep 29 2012 %Y A001605 Cf. A005478, A000045, A001578, A086597, A080345. %K A001605 nonn,hard,nice %O A001605 1,1 %A A001605 _N. J. A. Sloane_. %E A001605 Additional comments from _Robert G. Wilson v_, Aug 18 2000. More terms from David Broadhurst, Nov 08 2001. Two more terms (148091 and 201107) from _T. D. Noe_, Feb 12 2003 and Mar 04 2003. %E A001605 397379 from _T. D. Noe_, Aug 18 2003 %E A001605 433781, 590041, 593689 from Henri Lifchitz submitted by _Ray Chandler_, Feb 11 2005 %E A001605 604711 from Henri Lifchitz communicated by _Eric W. Weisstein_, Nov 29 2005 %E A001605 931517, 1049897, 1285607 found by Henri Lifchitz circa Nov 01 2008 and submitted by _Alexander Adamchuk_, Nov 28 2008 %E A001605 1636007 from Henri Lifchitz 03/2009, communicated by _Eric W. Weisstein_, Apr 24 2009 %E A001605 1803059 and 1968721 from Henri Lifchitz 11/2009, submitted by _Alex Ratushnyak_, Aug 08 2012 %I A023201 %S A023201 5,7,11,13,17,23,31,37,41,47,53,61,67,73,83,97,101,103,107,131,151, %T A023201 157,167,173,191,193,223,227,233,251,257,263,271,277,307,311,331,347, %U A023201 353,367,373,383,433,443,457,461,503,541,557,563,571,587,593,601,607,613,641,647 %N A023201 Numbers n such that n and n + 6 both prime. %H A023201 T. D. Noe, Table of n, a(n) for n = 1..10000 %H A023201 Eric Weisstein's World of Mathematics, Sexy Primes. %H A023201 Eric Weisstein's World of Mathematics, Twin Primes %p A023201 A023201 := proc(n) %p A023201 option remember; %p A023201 if n = 1 then %p A023201 5; %p A023201 else %p A023201 for a from procname(n-1)+2 by 2 do %p A023201 if isprime(a) and isprime(a+6) then %p A023201 return a; %p A023201 end if; %p A023201 end do: %p A023201 end if; %p A023201 end proc: # _R. J. Mathar_, May 28 2013 %t A023201 Select[Range[10^2], PrimeQ[ # ]&&PrimeQ[ #+6] &] (from _Vladimir Joseph Stephan Orlovsky_, Apr 29 2008) %o A023201 (MAGMA) [n: n in [0..40000] | IsPrime(n) and IsPrime(n+6)] [From _Vincenzo Librandi_, Aug 04 2010] %o A023201 (Haskell) %o A023201 a023201 n = a023201_list !! (n-1) %o A023201 a023201_list = filter ((== 1) . a010051 . (+ 6)) a000040_list %o A023201 -- _Reinhard Zumkeller_, Feb 25 2013 %o A023201 (PARI) is(n)=isprime(n+6)&&isprime(n) \\ _Charles R Greathouse IV_, Mar 20 2013 %Y A023201 A031924 and A007529 together give A023201. %Y A023201 Cf. A046117, A098428, A000040, A010051, A006489 (subsequence). %K A023201 nonn,easy %O A023201 1,1 %A A023201 _David W. Wilson_ %I A109611 %S A109611 2,3,5,7,11,13,17,19,23,29,31,37,41,47,53,59,67,71,83,89,101,107,109, %T A109611 113,127,131,137,139,149,157,167,179,181,191,197,199,211,227,233,239, %U A109611 251,257,263,269,281,293,307,311,317,337,347,353,359,379,389,401,409 %N A109611 Chen primes: primes p such that p + 2 is either a prime or a semiprime. %C A109611 43 is the first prime which is not a member (see A102540). %C A109611 Contains A001359 = lesser of twin primes. %C A109611 A063637 is a subsequence. [From _Reinhard Zumkeller_, Mar 22 2010] %D A109611 B. Green and T. Tao, Restriction theory of the Selberg sieve, with applications, 2005, pp. 5, 14, 18 - 19, 21 %H A109611 R. J. Mathar, Table of n, a(n) for n = 1..34076 %H A109611 B. Green and T. Tao, Restriction theory of the Selberg sieve, with applications, arXiv:math/0405581 [math.NT] %H A109611 Eric Weisstein's World of Mathematics, Chen's Theorem %H A109611 Eric Weisstein's World of Mathematics, Chen Prime %H A109611 Wikipedia, Chen prime %F A109611 a(n)+2 = A139690(n). %e A109611 a(4) = 7 because 7 + 2 = 9 and 9 is a semiprime. %e A109611 a(5) = 11 because 11 + 2 = 13, a prime. %p A109611 A109611 := proc(n) %p A109611 option remember; %p A109611 if n =1 then %p A109611 2; %p A109611 else %p A109611 a := nextprime(procname(n-1)) ; %p A109611 while true do %p A109611 if isprime(a+2) or numtheory[bigomega](a+2) = 2 then %p A109611 return a; %p A109611 end if; %p A109611 a := nextprime(a) ; %p A109611 end do: %p A109611 end if; %p A109611 end proc: # _R. J. Mathar_, Apr 26 2013 %t A109611 semiPrimeQ[x_] := TrueQ[Plus @@ Last /@ FactorInteger[ x ] == 2]; Select[Prime[Range[100]], PrimeQ[ # + 2] || semiPrimeQ[ # + 2] &] (* _Alonso del Arte_, Aug 08 2005 *) %o A109611 (PARI) isA001358(n)={ if( bigomega(n)==2, return(1), return(0) ); } isA109611(n)={ if( ! isprime(n), return(0), if( isprime(n+2), return(1), return( isA001358(n+2)) ); ); } { n=1; for(i=1,90000, p=prime(i); if( isA109611(p), print(n," ",p); n++; ); ); } /* _R. J. Mathar_, Aug 20 2006*/ %Y A109611 Cf. A001358. %Y A109611 Cf. A112021, A112022, A139689. %K A109611 nonn %O A109611 1,1 %A A109611 _Paul Muljadi_, Jul 31 2005 %E A109611 Corrected by _Alonso del Arte_, Aug 08 2005 %I A007500 M0657 %S A007500 2,3,5,7,11,13,17,31,37,71,73,79,97,101,107,113,131,149,151,157,167, %T A007500 179,181,191,199,311,313,337,347,353,359,373,383,389,701,709,727,733, %U A007500 739,743,751,757,761,769,787,797,907,919,929,937,941,953,967,971,983,991,1009,1021 %N A007500 Primes whose reversal in base 10 is also prime (called "palindromic primes" by D. Wells, although that name usually refers to A002385). Also called reversible primes. %C A007500 The numbers themselves need not be palindromes. %C A007500 The range is a subset of the range of A071786. [From _Reinhard Zumkeller_, Jul 06 2009] %D A007500 Roozbeh Hazrat, Mathematica: A Problem-Centered Approach, Springer 2010, pp. 39, 131-132 %D A007500 N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence). %D A007500 D. Wells, The Penguin Dictionary of Curious and Interesting Numbers. Penguin Books, NY, 1986, 134. %H A007500 T. D. Noe, Table of n, a(n) for n=1..10000 %t A007500 Select[ Prime[ Range[ 168 ] ], PrimeQ[ FromDigits[ Reverse[ IntegerDigits[ # ] ] ] ]& ] (from Zak Seidov, corrected by T. D. Noe) %o A007500 (MAGMA) [ p: p in PrimesUpTo(1030) | IsPrime(Seqint(Reverse(Intseq(p)))) ]; // Bruno Berselli, Jul 08 2011 %o A007500 (Haskell) %o A007500 a007500 n = a007500_list !! (n-1) %o A007500 a007500_list = filter ((== 1) . a010051 . a004086) a000040_list %o A007500 -- _Reinhard Zumkeller_, Oct 14 2011 %o A007500 (PARI) is_A007500(n)={ isprime(n) & is_A095179(n)} \\ - M. F. Hasler, Jan 13 2012 %Y A007500 Cf. A006567, A007628. %Y A007500 Cf. A002385 (primes that are palindromes in base 10) %Y A007500 Equals A002385 union A006567. %Y A007500 Complement of A076056 with respect to A000040. [From _Reinhard Zumkeller_, Jul 06 2009] %Y A007500 Cf. A004086, A010051, A000040. %K A007500 base,nonn,nice %O A007500 1,1 %A A007500 _N. J. A. Sloane_, _Robert G. Wilson v_ %E A007500 More terms from Larry Reeves (larryr(AT)acm.org), Oct 31 2000 %E A007500 Added further terms to the sequence Avik Roy (avik_3.1416(AT)yahoo.co.in), Jan 16 2009. Checked by _N. J. A. Sloane_, Jan 20 2009. %E A007500 Third reference added by Harvey P. Dale, Oct 17 2011 %I A171057 %S A171057 2,3,5,7,11,13,17,18,23,28,31,37,41,43,47,53,58,61,67,71,73,78,93,98, %T A171057 87,101,103,107,108,113,127,131,137,138,148,151,157,163,167,173,178, %U A171057 191,181,183,187,188,211,223,227,228,233,238,241,251,257,263 %N A171057 In the sequence of prime numbers, replace all the P digits by Q's and vice versa, where P and Q are 9 and 8. %H A171057 Vincenzo Librandi, Table of n, a(n) for n = 1..10000 %t A171057 FromDigits[IntegerDigits[#] /. {9 -> p, 8 -> q} /. {p -> 8, q -> 9}] & /@ Prime[Range[60]] (* _Vincenzo Librandi_, Mar 01 2013, after _Harvey P. Dale_ in similar sequences *) %K A171057 nonn,base %O A171057 1,1 %A A171057 _N. J. A. Sloane_ and _Vincenzo Librandi_, Sep 04 2010. # Content is available under The OEIS End-User License Agreement: http://oeis.org/LICENSE