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.

A069349 Number of ways to represent primes as A069348(n)=k+A001222(k).

Original entry on oeis.org

1, 2, 1, 2, 1, 2, 1, 1, 3, 1, 1, 2, 1, 2, 1, 1, 1, 3, 1, 1, 1, 1, 2, 1, 2, 2, 1, 1, 1, 2, 1, 1, 1, 1, 1, 2, 1, 1, 1, 3, 1, 1, 2, 1, 1, 1, 1, 1, 1, 1, 1, 3, 2, 2, 2, 1, 2, 1, 1, 1, 1, 3, 1, 1, 1, 2, 1, 2, 1, 1, 3, 1, 1, 1, 3, 3, 1, 1, 2, 1, 2, 1, 2, 2, 1, 1, 2, 1, 2, 2
Offset: 1

Views

Author

Reinhard Zumkeller, Mar 18 2002

Keywords

Examples

			a(9)=3 as: A069348(9)=53=A064800(48)=A064800(50)=A064800(51)
53=2*2*2*2*3+5 and 53=2*5*5+3 and 51=3*17+2.