login
The OEIS Foundation is supported by donations from users of the OEIS and by a grant from the Simons Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A327782 Numbers n that cannot be written as a sum of two or more distinct parts with the largest part dividing n. 0
1, 2, 3, 4, 5, 7, 9, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 59, 61, 67, 71, 73, 77, 79, 83, 89, 97, 101, 103, 107, 109, 113, 121, 127, 131, 137, 139, 143, 149, 151, 157, 163, 167, 169, 173, 179, 181, 187, 191, 193, 197, 199, 209, 211, 221 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,2

COMMENTS

After initial terms, first differs from A308168 in having 209.

LINKS

Table of n, a(n) for n=1..60.

MATHEMATICA

Select[Range[100], #==1||#-Divisors[#][[-2]]>Total[Range[Divisors[#][[-2]]-1]]&]

CROSSREFS

Cf. A000009, A018818, A032742, A033630, A102627, A326836, A326837, A326841, A326850, A326851, A327783.

Sequence in context: A343983 A074583 A001092 * A000430 A166684 A067126

Adjacent sequences:  A327779 A327780 A327781 * A327783 A327784 A327785

KEYWORD

nonn

AUTHOR

Gus Wiseman, Sep 25 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 | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified September 17 16:50 EDT 2021. Contains 347487 sequences. (Running on oeis4.)