cp's OEIS Frontend

This is a front-end for the Online Encyclopedia of Integer Sequences, made by Christian Perfect. The idea is to provide OEIS entries in non-ancient HTML, and then to think about how they're presented visually. The source code is on GitHub.

A071703 Number of ways to represent the n-th prime as arithmetic mean of three odd primes.

Original entry on oeis.org

0, 1, 2, 4, 8, 10, 14, 16, 20, 28, 32, 36, 47, 45, 48, 58, 68, 74, 81, 95, 88, 101, 108, 119, 134, 146, 143, 150, 161, 161, 195, 208, 215, 222, 244, 257, 259, 269, 283, 293, 319, 332, 354, 346, 359, 365, 417, 426, 442, 455, 454, 500, 497, 526
Offset: 1

Views

Author

Reinhard Zumkeller, Jun 03 2002

Keywords

Examples

			a(4)=4 as A000040(4)=7 and there are no more representations than 7 = (3+5+13)/3 = (3+7+11)/3 = (5+5+11)/3 = (7+7+7)/3.
		

Crossrefs

Programs

  • Haskell
    a071703 = z a065091_list 0 . (* 3) . a000040 where
       z _ 3 m = fromEnum (m == 0)
       z ps'@(p:ps) i m = if m < p then 0 else z ps' (i+1) (m - p) + z ps i m
    -- Reinhard Zumkeller, May 24 2015

Extensions

Definition, initial term and example corrected. Thanks to Zak Seidov, who found the mistake. - Reinhard Zumkeller, May 24 2015