login
This site is supported by donations to The OEIS Foundation.

 

Logo


Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A196528 Smallest number m such that A196527(m) = n. 2
4, 1, 26, 11, 2, 57, 13, 15, 179, 77, 382, 161, 92, 635, 376, 513, 222, 331, 420, 1961, 4080, 933, 685, 103, 386, 49, 1233, 33, 3520, 1317, 196, 1301, 562, 3765, 902, 1769, 7549, 547, 1938, 3349, 1124, 3345, 545, 275, 6606, 21277, 88, 3247, 1411, 955, 6921 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

COMMENTS

Smallest number m such that n equals the greatest common divisor of sums of first n prime numbers and first n composite numbers:

A196527(a(n)) = n and A196527(m) <> n for m < a(n).

LINKS

Reinhard Zumkeller, Table of n, a(n) for n = 1..100

CROSSREFS

Sequence in context: A062328 A263918 A136234 * A135897 A039816 A118283

Adjacent sequences:  A196525 A196526 A196527 * A196529 A196530 A196531

KEYWORD

nonn

AUTHOR

Reinhard Zumkeller, Oct 03 2011

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 April 19 16:58 EDT 2019. Contains 322283 sequences. (Running on oeis4.)