This site is supported by donations to The OEIS Foundation.

 Hints (Greetings from The On-Line Encyclopedia of Integer Sequences!)
 A286564 Triangular table A286563 reversed. 4

%I

%S 1,1,1,1,0,1,1,0,2,1,1,0,0,0,1,1,0,0,1,1,1,1,0,0,0,0,0,1,1,0,0,0,1,0,

%T 3,1,1,0,0,0,0,0,2,0,1,1,0,0,0,0,1,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,1,0,

%U 0,0,0,0,1,0,1,1,2,1,1,0,0,0,0,0,0,0,0,0,0,0,1,1,0,0,0,0,0,0,1,0,0,0,0,1,1,1,0,0,0,0,0,0,0,0,0,1,0,1,0,1

%N Triangular table A286563 reversed.

%C See A286563.

%H Antti Karttunen, <a href="/A286564/b286564.txt">Table of n, a(n) for n = 1..7875; the first 125 rows of the triangle</a>

%e The first fifteen rows of this triangular table:

%e 1,

%e 1, 1,

%e 1, 0, 1,

%e 1, 0, 2, 1,

%e 1, 0, 0, 0, 1,

%e 1, 0, 0, 1, 1, 1,

%e 1, 0, 0, 0, 0, 0, 1,

%e 1, 0, 0, 0, 1, 0, 3, 1,

%e 1, 0, 0, 0, 0, 0, 2, 0, 1,

%e 1, 0, 0, 0, 0, 1, 0, 0, 1, 1,

%e 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,

%e 1, 0, 0, 0, 0, 0, 1, 0, 1, 1, 2, 1,

%e 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1,

%e 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1, 1,

%e 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 1, 0, 1

%t Table[If[k == 1, 1, IntegerExponent[n, k]], {n, 15}, {k, n, 1, -1}] // Flatten (* _Michael De Vlieger_, May 20 2017 *)

%o (Scheme) (define (A286564 n) (A286561bi (A002024 n) (A004736 n))) ;; For A286561bi see A286561.

%o (Python)

%o def T(n, k):

%o i=1

%o if k==1: return 1

%o while n%(k**i)==0:

%o i+=1

%o return i-1

%o for n in xrange(1, 21): print [T(n, k) for k in xrange(1, n + 1)] [::-1] # _Indranil Ghosh_, May 20 2017

%Y Cf. A286561, A286563.

%Y Cf. A169594 (row sums).

%K nonn,tabl

%O 1,9

%A _Antti Karttunen_, May 20 2017

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

Last modified July 21 19:25 EDT 2019. Contains 325199 sequences. (Running on oeis4.)