The OEIS is supported by the many generous donors to the OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A024683 a(n) is the number of ways prime(n) is a sum of two composite numbers r,s satisfying r < s. 1
 0, 0, 0, 0, 0, 1, 1, 2, 2, 4, 5, 6, 7, 8, 8, 10, 12, 13, 14, 15, 16, 17, 18, 20, 23, 24, 25, 25, 26, 26, 32, 33, 35, 36, 39, 40, 41, 43, 44, 46, 48, 49, 52, 53, 53, 54, 58, 63, 64, 65, 65, 67, 68, 71, 73, 75, 77, 78, 79, 80, 81, 84, 90, 91, 92, 92, 98, 100, 104, 105, 105, 107, 110, 112, 114 (list; graph; refs; listen; history; text; internal format)
 OFFSET 1,8 LINKS J. Stauduhar, Table of n, a(n) for n = 1..5000 FORMULA a(n) = Sum_{i=4..floor((prime(n)-1)/2)} c(i) * c(prime(n)-i), where c is the characteristic function of composite numbers (A066247) and prime(n) is the n-th prime (A000040). - Wesley Ivan Hurt, Sep 08 2020 MATHEMATICA z = 400; c = Select[Range[2, z], ! PrimeQ@# &];  (* A002808 *) d = Select[Range[2, z], ! PrimeQ@# && OddQ@# &];  (* A014076 *) a[n_] := Length[Intersection[c, Prime[n] - Select[d, # < Prime[n] &]]]; Table[a[n], {n, 1, 120}] (* A024683 *) (* Clark Kimberling, Jul 21 2020 *) CROSSREFS Subsequence of A224708. Cf. A000040, A066247. Sequence in context: A325108 A329474 A260295 * A244017 A339022 A341467 Adjacent sequences:  A024680 A024681 A024682 * A024684 A024685 A024686 KEYWORD nonn,easy AUTHOR STATUS approved

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.

Last modified July 4 12:28 EDT 2022. Contains 355075 sequences. (Running on oeis4.)