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.

A181287 Numbers of the form i*5^j-1 (i=1..4, j >= 0).

This page as a plain text file.
%I A181287 #30 May 05 2024 03:30:23
%S A181287 0,1,2,3,4,9,14,19,24,49,74,99,124,249,374,499,624,1249,1874,2499,
%T A181287 3124,6249,9374,12499,15624,31249,46874,62499,78124,156249,234374,
%U A181287 312499,390624,781249,1171874,1562499,1953124,3906249,5859374,7812499,9765624,19531249,29296874,39062499,48828124,97656249,146484374,195312499
%N A181287 Numbers of the form i*5^j-1 (i=1..4, j >= 0).
%C A181287 Row numbers of Pascal's Triangle where none of the binomial coefficients in that row is divisible by 5. - _Thomas M. Green_, Apr 02 2013
%H A181287 <a href="/index/Rec#order_05">Index entries for linear recurrences with constant coefficients</a>, signature (1,0,0,5,-5).
%F A181287 a(n) = a(n-1)+5*a(n-4)-5*a(n-5). G.f.: x^2*(x+1)*(x^2+1) / ((x-1)*(5*x^4-1)). [_Colin Barker_, Feb 01 2013]
%e A181287 For n = 7, a(7) = 14 and the binomial coefficients in the 14th row of Pascal's Triangle are 1 14 91 364 1001 2002 3003 3432 3003 2002 1001 364 91 14 1 and none of the elements in that row is divisible by 5. - _Thomas M. Green_, Apr 05 2013
%Y A181287 Smallest number whose base b sum of digits is n: A000225 (b=2), A062318 (b=3), A180516 (b=4), this sequence (b=5), A181288 (b=6), A181303 (b=7), A165804 (b=8), A140576 (b=9), A051885 (b=10). - _Jason Kimberley_, Nov 02 2011
%K A181287 nonn,easy
%O A181287 1,3
%A A181287 _N. J. A. Sloane_, Jan 25 2011