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.

A081852 Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).

This page as a plain text file.
%I A081852 #3 Mar 30 2012 16:49:43
%S A081852 1,4,20,2,7,8,3,26631380,55,4,416,112,5,32,34,6,285,13960,7,67358874,
%T A081852 214544,8,75,78,9,62186796,7399041846,10,1178,173857344,11,136,140,12,
%U A081852 24494,2090,13,78824360,2624,14,215,220,15,3772,61617,16,23001295794169,78900,17,312
%N A081852 Consider recurrence b(0) = n/3, b(n) = b(0)*ceiling(b(n-1)); sequence gives first integer reached (or -1 if no integer is ever reached).
%Y A081852 Cf. A073524, A081849, A081850, A081851. A074078 gives number of steps to reach an integer.
%K A081852 nonn
%O A081852 3,2
%A A081852 _N. J. A. Sloane_, Apr 13 2003