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.

A281006 a(n) = A000203(n) - A052928(n-1).

Original entry on oeis.org

1, 3, 2, 5, 2, 8, 2, 9, 5, 10, 2, 18, 2, 12, 10, 17, 2, 23, 2, 24, 12, 16, 2, 38, 7, 18, 14, 30, 2, 44, 2, 33, 16, 22, 14, 57, 2, 24, 18, 52, 2, 56, 2, 42, 34, 28, 2, 78, 9, 45, 22, 48, 2, 68, 18, 66, 24, 34, 2, 110, 2, 36, 42, 65, 20, 80, 2, 60, 28, 76, 2, 125, 2, 42, 50, 66, 20, 92, 2, 108, 41, 46, 2, 142, 24, 48, 34, 94, 2
Offset: 1

Views

Author

Omar E. Pol, Jan 23 2017

Keywords

Comments

a(n) = 2 iff n is an odd prime (A065091).
Has a symmetric representation as a narrow pyramid with holes, in the same way as A249351.

Examples

			A000203    A052928     a(n)
.   1    -    0    =    1
.   3    -    0    =    3
.   4    -    2    =    2
.   7    -    2    =    5
.   6    -    4    =    2
.  12    -    4    =    8
...
		

Crossrefs

Programs

Formula

a(n) = sigma(n) - 2*floor((n - 1)/2) = A000203(n) - 2*A004526(n-1).
a(n) = A048050(n) + A176059(n), n >= 2.