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

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A302111 a(n) is the number of ways n can be written as a sum of two (not necessarily distinct) terms of A303600. 0
 0, 0, 0, 1, 1, 2, 2, 2, 1, 1, 1, 2, 3, 3, 2, 1, 0, 2, 2, 3, 2, 1, 0, 1, 2, 3, 3, 1, 1, 1, 3, 5, 5, 3, 2, 0, 1, 3, 4, 4, 2, 1, 0, 3, 2, 4, 2, 2, 0, 1, 2, 4, 4, 2, 1, 1, 2, 5, 5, 4, 3, 0, 0, 2, 3, 5, 2, 0, 0, 1, 2, 4, 1, 3, 2, 1, 2, 4, 5, 4, 2, 1, 2, 5, 4, 4, 3, 0, 1, 0, 2, 6, 3 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,6 COMMENTS Some numbers can be written in more than one way as a sum of two terms of A303600. This gives a(n) > 1. Some numbers can't be written in more than one way as a sum of two terms of A303600. This gives a(n) = 0. n such that a(n) is 1 gives terms of A303600. LINKS CROSSREFS Cf. A303600. Sequence in context: A144110 A076490 A320278 * A124278 A253187 A139755 Adjacent sequences:  A302108 A302109 A302110 * A302112 A302113 A302114 KEYWORD nonn AUTHOR David A. Corneth, Apr 27 2018 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.

Last modified September 29 10:06 EDT 2020. Contains 337428 sequences. (Running on oeis4.)