login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A307547 a(n) is the smallest divisor of the partition number P(n) = A000041(n) not already in the sequence. 1
1, 2, 3, 5, 7, 11, 15, 22, 6, 14, 4, 77, 101, 9, 8, 21, 27, 35, 10, 19, 12, 167, 251, 25, 89, 28, 43, 13, 55, 467, 311, 23, 49, 1231, 33, 17977, 281, 121, 45, 42, 193, 2417, 71, 31, 41, 73, 38, 7013, 275, 9283, 363, 53, 63, 17, 142, 47, 102359, 20, 44, 139 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

Provided A046641(m) is defined for any number m > 0, this sequence is a permutation of the natural numbers.

LINKS

Rémy Sigrist, Table of n, a(n) for n = 1..5000

Rémy Sigrist, PARI program for A307547

FORMULA

a(A049575(k)) = A049575(k).

EXAMPLE

The first terms, alongside the divisors of P(n), are:

  n   a(n)  div(P(n))

  --  ----  --------------------

   1     1  (1)

   2     2  (1, 2)

   3     3  (1, 3)

   4     5  (1, 5)

   5     7  (1, 7)

   6    11  (1, 11)

   7    15  (1, 3, 5, 15)

   8    22  (1, 2, 11, 22)

   9     6  (1, 2, 3, 5, 6, 10, 15, 30)

  10    14  (1, 2, 3, 6, 7, 14, 21, 42)

PROG

(PARI) See Links section.

CROSSREFS

Cf. A000041, A046641, A049575, A309200.

Sequence in context: A036007 A027342 A184643 * A182804 A242695 A319473

Adjacent sequences:  A307544 A307545 A307546 * A307548 A307549 A307550

KEYWORD

nonn

AUTHOR

Rémy Sigrist, Jul 27 2019

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified May 29 02:45 EDT 2022. Contains 354122 sequences. (Running on oeis4.)