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.

A286248 Triangle A286249 reversed.

Original entry on oeis.org

1, 2, 3, 4, 0, 3, 7, 0, 5, 10, 11, 0, 0, 0, 3, 16, 0, 0, 8, 5, 21, 22, 0, 0, 0, 0, 0, 3, 29, 0, 0, 0, 12, 0, 14, 36, 37, 0, 0, 0, 0, 0, 8, 0, 10, 46, 0, 0, 0, 0, 17, 0, 0, 5, 21, 56, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 67, 0, 0, 0, 0, 0, 23, 0, 12, 19, 27, 78, 79, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 3, 92, 0, 0, 0, 0, 0, 0, 30, 0, 0, 0, 0, 5, 21, 106, 0, 0, 0, 0, 0, 0, 0, 0, 0, 17, 0, 8, 0, 21
Offset: 1

Views

Author

Antti Karttunen, May 06 2017

Keywords

Comments

See A286249.

Examples

			Triangle begins:
   1,
   2, 3,
   4, 0, 3,
   7, 0, 5, 10,
  11, 0, 0,  0, 3,
  ...
		

Crossrefs

Transpose: A286249 (triangle reversed).

Programs

  • Python
    from sympy import factorint
    import math
    def T(n, m): return ((n + m)**2 - n - 3*m + 2)//2
    def P(n):
        f = factorint(n)
        return sorted([f[i] for i in f])
    def a046523(n):
        x=1
        while True:
            if P(n) == P(x): return x
            else: x+=1
    def t(n, k): return 0 if n%k!=0 else T(a046523(n//k), k)
    for n in range(1, 21): print([t(n, k) for k in range(1, n + 1)][::-1]) # Indranil Ghosh, May 08 2017
  • Scheme
    (define (A286248 n) (A286249tr (A002024 n) (A004736 n))) ;; For A286249tr, see A286249.
    

Formula

T(n,k) = A286249(k,n).