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!)
A082785 Number of ways n can be written as the sum of a brilliant number and a prime. 1

%I #5 Dec 15 2017 17:36:11

%S 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,

%T 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,

%U 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

%N Number of ways n can be written as the sum of a brilliant number and a prime.

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

%Y Cf. A078972.

%K nonn

%O 1,9

%A _Jason Earls_, Jun 26 2003

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 April 20 00:03 EDT 2024. Contains 371798 sequences. (Running on oeis4.)