cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

Previous Showing 31-40 of 51 results. Next

A038601 Prime numbers p such that the number of partitions of p is also a prime.

Original entry on oeis.org

2, 3, 5, 13, 157, 491, 863, 1621, 2633, 5347, 8117, 13513, 35227, 62311, 76367, 84017, 141637, 170537, 189353, 192667, 201821, 216617, 251677, 269257, 288203, 293621, 353807, 366103, 367621, 372023, 441703, 444167, 478571, 518657, 582371, 626333, 780707, 816521
Offset: 1

Views

Author

Keywords

Examples

			5 = (1+1+1+1+1+1,1+1+1+2,1+1+3,1+4,1+2+2,2+3,5), so partition(5) = 7; 5 and 7 are primes.
		

Crossrefs

Programs

  • Mathematica
    Do[ If[ PrimeQ[n] && PrimeQ[ PartitionsP[n]], Print[n]], {n, 1, 10^5} ]

Extensions

More terms from Simon Plouffe
More terms from Robert G. Wilson v, Aug 29 2001
a(17)-a(36) from Jacques Tramu, Jun 26 2005
Corrected by T. D. Noe, Oct 31 2006
Offset changed and a(37)-a(38) from Michael S. Branicky, Jun 24 2025

A046064 Not a product of partition numbers (A000041).

Original entry on oeis.org

13, 17, 19, 23, 26, 29, 31, 34, 37, 38, 39, 41, 43, 46, 47, 51, 52, 53, 57, 58, 59, 61, 62, 65, 67, 68, 69, 71, 73, 74, 76, 78, 79, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97, 102, 103, 104, 106, 107, 109, 111, 113, 114, 115, 116, 117, 118, 119, 122, 123, 124, 127
Offset: 1

Views

Author

Keywords

Crossrefs

Programs

  • Maple
    with(combinat): A000041:=proc(n) options remember: RETURN(numbpart(n)): end: partdiv:=proc(m,i) local j,q,f: f:=0: for j from i by -1 to 2 while(f=0) do if(irem(m, A000041(j))=0) then q:=iquo(m, A000041(j)): if(q=1) then RETURN(1) else f:=partdiv(q,j) fi fi od: RETURN(f): end: for i from 2 to 14 do for n from A000041(i) to A000041(i+1)-1 do m:=partdiv(n,i): if m=0 then printf("%d, ",n) fi od od: # C. Ronaldo

A115214 Numbers n such that p(12n) is prime, where p(n) is the number of partitions of n.

Original entry on oeis.org

3, 11, 14, 18, 108, 178, 209, 214, 264, 704, 1085, 1354, 1523, 2550, 2770, 2831, 3709, 6055, 8241, 9011, 10590, 11360, 11780, 15358, 18305, 23576, 23628, 24331, 25589, 25620, 32435, 40219, 41373, 48204, 50239, 53174, 55984, 57521, 78831, 84136
Offset: 1

Views

Author

Robert G. Wilson v, Nov 14 2005

Keywords

Comments

n belongs to this sequence if and only if 12n belongs to A046063.

Crossrefs

Programs

  • Mathematica
    Select[ Range@34000, PrimeQ@ PartitionsP[12# ] &]

Extensions

More terms from Max Alekseyev, Dec 18 2011

A285216 Indices of primes in A000219.

Original entry on oeis.org

2, 4, 11, 30, 32, 40, 50, 85, 100, 237, 381, 733, 805, 882, 1015, 1650, 2439, 3163, 3335, 3506, 3675, 4152, 4446, 4576, 5010, 5101, 6045, 6760, 7412, 8178, 8562, 10026, 10527, 10888, 12406, 12693, 13479, 16109, 16978, 17962, 20696, 22483, 25383, 31458, 38956
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 14 2017

Keywords

Examples

			11 is in the sequence because A000219(11) = 859 is prime.
		

Crossrefs

Programs

A285217 Indices of primes in A000712.

Original entry on oeis.org

1, 2, 70, 106, 330, 366, 370, 546, 836, 1370, 1870, 2126, 2616, 4240, 4836, 4956, 9520, 10896, 11446, 14250, 15836, 16170, 18040, 18566, 26516, 28676, 37060, 40546, 40760, 46850, 52060, 57176, 67726, 74776, 78460, 90810, 98216, 108870, 115400, 115990, 123930
Offset: 1

Views

Author

Vaclav Kotesovec, Apr 14 2017

Keywords

Examples

			70 is in the sequence because A000712(70) = 7592053897 is prime.
		

Crossrefs

A355705 Indices k of partition function p where p(k) and p(k) - 2 are twin primes.

Original entry on oeis.org

4, 5, 186, 3542
Offset: 1

Views

Author

Serge Batalov, Jul 15 2022

Keywords

Comments

Because asymptotically size of partitions number function p(n) ~ O(exp(sqrt(n))), and probability of primality of p(n) ~ O(1/sqrt(n)) and combined probability of primality of p(n) and p(n)+-2 is ~ O(1/n), the sum of the prime probabilities is diverging and there are no obvious restrictions on primality; therefore, this sequence may be conjectured to be infinite.
a(5) > 10^7.

Examples

			4 is a term because A000041(4) = 5, and 3 and 5 are twin primes.
5 is a term because A000041(5) = 7, and 5 and 7 are twin primes.
		

Crossrefs

Programs

  • PARI
    for(n=1, 3600, if(ispseudoprime(p=numbpart(n))&&ispseudoprime(p-2), print1(n, ", ")))

A091689 Smallest partition number with n-th prime as factor.

Original entry on oeis.org

2, 3, 5, 7, 11, 3718, 386155, 627, 8349, 2436, 75175, 34262962, 14883, 3010, 526823, 281589, 386155, 1064144451, 124754, 63261, 105558, 2552338241, 4565, 1958, 75175, 101, 12132164, 118114304, 37274405776748077, 1505499, 37338, 6185689, 2323520, 966467, 90175434980549623
Offset: 1

Views

Author

Reinhard Zumkeller, Jan 29 2004

Keywords

Comments

Erdős conjectured that every prime divides at least one value of the partition function, see Ahlgren and Ono link.

Examples

			For n = 10, A000040(10) = 29: a(10) = A000041(26) = 2436 = 29*7*3*2*2, as 29 does not divide smaller partition numbers.
		

Crossrefs

Formula

a(n) = A000041(A091690(n)).

Extensions

More terms from Amiram Eldar, May 16 2025

A094699 Number of prime partition numbers <= n-th partition number.

Original entry on oeis.org

0, 0, 1, 2, 3, 4, 5, 5, 5, 5, 5, 5, 5, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8
Offset: 0

Views

Author

Reinhard Zumkeller, May 20 2004

Keywords

Crossrefs

Programs

  • Mathematica
    Accumulate[Boole[PrimeQ[Table[PartitionsP[n], {n, 0, 100}]]]] (* Amiram Eldar, May 15 2025 *)
  • PARI
    a(n)=sum(i=1,n,ispseudoprime(numbpart(i))) \\ Charles R Greathouse IV, May 28 2015

Extensions

Offset corrected by Amiram Eldar, May 15 2025

A094700 Number of partition numbers that are smaller than and coprime to the n-th partition number.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 5, 6, 4, 4, 6, 7, 13, 9, 8, 5, 7, 5, 6, 8, 5, 8, 17, 7, 10, 6, 7, 10, 10, 10, 10, 10, 13, 12, 11, 36, 14, 13, 5, 9, 8, 12, 12, 31, 26, 14, 17, 19, 18, 14, 15, 10, 21, 10, 19, 30, 17, 9, 9, 59, 7, 16, 36, 11, 37, 23, 67, 19, 47, 19, 25, 39, 70, 13, 10, 52, 77, 24
Offset: 0

Views

Author

Reinhard Zumkeller, May 20 2004

Keywords

Comments

a(n) = n iff n <= 1 or A000041(n) is prime. [corrected by Amiram Eldar, May 15 2025]

Crossrefs

Programs

Extensions

Offset corrected by Amiram Eldar, May 15 2025

A145523 Least integer k > 0 such that A000041(k) is divisible by 2^n.

Original entry on oeis.org

1, 2, 11, 11, 15, 66, 66, 96, 96, 96, 96, 96, 3693, 15005, 18978, 18978, 18978, 43002, 55943, 972190, 1151214, 2799146, 15519397, 15519397, 15519397, 122101417, 210553237, 289585489, 473093534
Offset: 0

Views

Author

M. F. Hasler, Oct 12 2008

Keywords

Comments

The requirement a(n) > 0 is somewhat arbitrary, chosen for agreement with A046641; a(n) >= 0 would have been possible, too, yielding a(0)=0.
a(29) > 10^9.

Crossrefs

Programs

  • sh
    i=1; c=1; while [ $c -le 21 ]; do echo -n `./A046641 $i`", "; c=`expr $c + 1`; i=`expr $i + $i`; done # M. F. Hasler, Oct 18 2008

Formula

a(n) = A046641(2^n).

Extensions

More terms from M. F. Hasler, Oct 18 2008
a(22)-a(28) from Max Alekseyev, Dec 16 2011
Previous Showing 31-40 of 51 results. Next