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.

A079624 a(1) = a(2) = 1, a(3) = 6, a(n) = abs(a(n-1) - a(n-2) - a(n-3)).

Original entry on oeis.org

1, 1, 6, 4, 3, 7, 0, 10, 3, 7, 6, 4, 9, 1, 12, 2, 11, 3, 10, 4, 9, 5, 8, 6, 7, 7, 6, 8, 5, 9, 4, 10, 3, 11, 2, 12, 1, 13, 0, 14, 1, 13, 2, 12, 3, 11, 4, 10, 5, 9, 6, 8, 7, 7, 8, 6, 9, 5, 10, 4, 11, 3, 12, 2, 13, 1, 14, 0, 15, 1, 14, 2, 13, 3, 12, 4, 11, 5, 10, 6, 9, 7, 8, 8, 7, 9, 6, 10, 5, 11, 4, 12, 3
Offset: 1

Views

Author

Benoit Cloitre, Jan 30 2003

Keywords

Crossrefs

Programs

  • Haskell
    a079624 n = a079624_list !! (n-1)
    a079624_list = 1 : 1 : 6 : zipWith3 (\u v w -> abs (w - v - u))
                   a079624_list (tail a079624_list) (drop 2 a079624_list)
    -- Reinhard Zumkeller, Oct 11 2014
    
  • Magma
    m:=120;
    A079624:=[n le 3 select 6^Floor((n-1)/2) else Abs(Self(n-1) - Self(n-2) - Self(n-3)): n in [1..m+5]];
    [A079624[n]: n in [1..m]]; // G. C. Greubel, Sep 11 2024
    
  • Mathematica
    a[n_]:= a[n]= If[n<4, 6^Floor[(n-1)/2], Abs[a[n-1] -a[n-2] -a[n-3]]];
    Table[a[n], {n,100}] (* G. C. Greubel, Sep 11 2024 *)
  • SageMath
    @CachedFunction
    def a(n): # a = A079624
        if n<4: return 6^((n-1)//2)
        else: return abs(a(n-1)-a(n-2)-a(n-3))
    [a(n) for n in range(1,101)] # G. C. Greubel, Sep 11 2024

Formula

For n >= 5, a(n^2 + 24*n - 13) = 0.
For n >= 38, Max( a(k) : 1<=k<=n) = floor(sqrt(n+156)).