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

 

Logo

Please make a donation to keep the OEIS running. We are now in our 55th year. In the past year we added 12000 new sequences and reached 8000 citations (which often say "discovered thanks to the OEIS"). We need to raise money to hire someone to manage submissions, which would reduce the load on our editors and speed up editing.
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A082785 Number of ways n can be written as the sum of a brilliant number and a prime. 1
0, 0, 0, 0, 0, 1, 1, 1, 2, 0, 3, 2, 2, 1, 2, 2, 5, 1, 2, 2, 3, 2, 4, 1, 2, 3, 4, 4, 2, 1, 1, 4, 3, 2, 2, 1, 3, 5, 1, 3, 2, 2, 2, 3, 2, 3, 3, 2, 1, 2, 4, 5, 2, 3, 1, 4, 3, 3, 1, 1, 1, 5, 2, 2, 2, 3, 2, 5, 1, 1, 2, 3, 2, 2, 2, 3, 3, 3, 1, 3, 2, 4, 2, 1, 2, 3, 2, 4, 2, 1, 0, 4, 3, 3, 1, 3, 1, 3, 1, 1, 1, 2, 2, 3, 1 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,9

LINKS

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

EXAMPLE

a(17) = 5 because 17 = 4+13 = 6+11 = 10+7 = 14+3 = 15+2.

CROSSREFS

Cf. A078972.

Sequence in context: A221879 A171934 A303205 * A100949 A152164 A263112

Adjacent sequences:  A082782 A082783 A082784 * A082786 A082787 A082788

KEYWORD

nonn

AUTHOR

Jason Earls, Jun 26 2003

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 December 6 16:24 EST 2019. Contains 329808 sequences. (Running on oeis4.)