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.

A171233 Array, T(n,k) = 2*(n/k), if n mod k = 0; otherwise, T(n,k) = 1. Read by antidiagonals.

This page as a plain text file.
%I A171233 #7 Dec 10 2016 22:35:40
%S A171233 2,4,1,6,2,1,8,1,1,1,10,4,2,1,1,12,1,1,1,1,1,14,6,1,2,1,1,1,16,1,4,1,
%T A171233 1,1,1,1,18,8,1,1,2,1,1,1,1,20,1,1,1,1,1,1,1,1,1,22,10,6,4,1,2,1,1,1,
%U A171233 1,1,24,1,1,1,1,1,1,1,1,1,1,1,26,12,1,1,1,1,2,1,1,1,1,1,1,28,1,8,1,4,1,1,1
%N A171233 Array, T(n,k) = 2*(n/k), if n mod k = 0; otherwise, T(n,k) = 1. Read by antidiagonals.
%C A171233 T(n,3): continued fraction expansion of e - 1.
%F A171233 T(n,k) = A171232(n,k) + A077049(n,k).
%e A171233 Array begins
%e A171233 2 1 1 1 ...
%e A171233 4 2 1 1 ...
%e A171233 6 1 2 1 ...
%e A171233 8 4 1 2 ...
%e A171233 ...........
%p A171233 A171233 := proc(n,k) if n mod k <> 0 then 1; else 2*n/k ; end if; end proc: seq(seq(A171233(d-k+1,k),k=1..d),d=1..17) ; # _R. J. Mathar_, Dec 08 2009
%Y A171233 Cf. T(n,1) = A005843(n-1), A171232, A077049.
%K A171233 cofr,nonn,tabl
%O A171233 1,1
%A A171233 _Ross La Haye_, Dec 05 2009
%E A171233 Terms beyond the 6th antidiagonal from _R. J. Mathar_, Dec 08 2009