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.

A133565 a(1)=1. a(n+1) = sum{k=non-isolated divisors of n} a(k). A non-isolated divisor, k, of n is a positive divisor of n where (k-1) or (k+1) divides n.

Original entry on oeis.org

1, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 4, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 2, 0, 3, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 1, 0, 1, 0, 3, 0, 1, 0, 1, 0, 2, 0, 2, 0, 1, 0, 4, 0, 1, 0, 1, 0, 4, 0, 1, 0, 1, 0, 2, 0, 1, 0, 2, 0, 2, 0, 1
Offset: 1

Views

Author

Leroy Quet, Sep 16 2007

Keywords

Comments

a(2n) = 0 since 2n-1 has no non-isolated divisors. - Ray Chandler

Examples

			The positive divisors of 20 are 1,2,4,5,10,20. Of these, 1 and 2 are adjacent and 4 and 5 are adjacent. So the non-isolated divisors of 20 are 1,2, 4,5. Therefore a(21) = a(1) + a(2) + a(4) + a(5) = 1 + 0 + 0 + 1 = 2.
		

Crossrefs

Programs

Extensions

Extended by Ray Chandler, Jun 25 2008