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.

A264984 Even bisection of A263273; terms of A263262 doubled.

Original entry on oeis.org

0, 2, 4, 6, 8, 10, 12, 22, 16, 18, 20, 14, 24, 26, 28, 30, 64, 46, 36, 58, 40, 66, 76, 34, 48, 70, 52, 54, 56, 38, 60, 74, 32, 42, 68, 50, 72, 62, 44, 78, 80, 82, 84, 190, 136, 90, 172, 118, 192, 226, 100, 138, 208, 154, 108, 166, 112, 174, 220, 94, 120, 202, 148, 198, 184, 130
Offset: 0

Views

Author

Antti Karttunen, Dec 05 2015

Keywords

Crossrefs

Programs

  • Python
    from sympy import factorint
    from sympy.ntheory.factor_ import digits
    from operator import mul
    def a030102(n): return 0 if n==0 else int(''.join(map(str, digits(n, 3)[1:][::-1])), 3)
    def a038502(n):
        f=factorint(n)
        return 1 if n==1 else reduce(mul, [1 if i==3 else i**f[i] for i in f])
    def a038500(n): return n/a038502(n)
    def a263273(n): return 0 if n==0 else a030102(a038502(n))*a038500(n)
    def a(n): return a263273(2*n) # Indranil Ghosh, May 22 2017
  • Scheme
    (define (A264984 n) (A263273 (+ n n)))
    

Formula

a(n) = 2 * A263272(n).
a(n) = A263273(2*n).
Other identities. For all n >= 0:
A010873(a(n)) = 2 * A000035(n) = A010673(n).