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.

A141256 An Okazaki-like composition, see A126759.

Original entry on oeis.org

1, 2, 2, 2, 2, 2, 2, 3, 2, 2, 2, 4, 2, 5, 3, 2, 2, 6, 2, 7, 2, 3, 4, 8, 2, 2, 5, 2, 3, 9, 2, 10, 2, 4, 6, 3, 2, 11, 7, 5, 2, 12, 3, 13, 4, 2, 8, 14, 2, 15, 2, 6, 5, 16, 2, 4, 3, 7, 9, 17, 2, 18, 10, 3, 2, 5, 4, 19, 6, 8, 3, 20, 2, 21, 11, 2, 7, 22, 5, 23, 2, 2, 12, 24, 3, 6, 13, 9, 4, 25, 2, 26, 8, 10, 14
Offset: 0

Views

Author

Reinhard Zumkeller, Jun 17 2008

Keywords

Comments

a(5*n) = a(3*n) = a(2*n) = a(n);
for n with GCD(n,30)=1: a(n+30*k)=a(n)+8*k, note: 30=2*3*5,
A000010(30)=8;
for k>1: a(A007775(k-1))=k and a(m)A007775(k-1).

Formula

a(n) = if n=0 then 1 else if GCD(n,30)>1 then a(LPD(n)) else 2*floor(n/30) + (if n mod 30 = 1 then 2 else IP(n)-1), with IP=A049084, LPD=A032742 and GCD=A050873.