A010875 -id:A010875 - cp's OEIS frontend

A130485 a(n) = Sum_{k=0..n} (k mod 7) (Partial sums of A010876).

0, 1, 3, 6, 10, 15, 21, 21, 22, 24, 27, 31, 36, 42, 42, 43, 45, 48, 52, 57, 63, 63, 64, 66, 69, 73, 78, 84, 84, 85, 87, 90, 94, 99, 105, 105, 106, 108, 111, 115, 120, 126, 126, 127, 129, 132, 136, 141, 147, 147, 148, 150, 153, 157, 162, 168, 168, 169, 171, 174, 178, 183

Offset: 0

Hieronymus Fischer, May 31 2007

Let A be the Hessenberg n X n matrix defined by A[1,j] = j mod 7, A[i,i]:=1, A[i,i-1]=-1. Then, for n >= 1, a(n)=det(A). - Milan Janjic, Jan 24 2010

Shawn A. Broyles, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,1,-1).

Cf. A010872, A010873, A010874, A010875, A010877, A130481, A130482, A130483, A130484.

a:=[0,1,3,6,10,15,21,21];; for n in [9..71] do a[n]:=a[n-1]+a[n-7]-a[n-8]; od; a; # G. C. Greubel, Aug 31 2019

I:=[0,1,3,6,10,15,21,21]; [n le 8 select I[n] else Self(n-1) + Self(n-7) - Self(n-8): n in [1..71]]; // G. C. Greubel, Aug 31 2019

a:=n->add(chrem( [n,j], [1,7] ),j=1..n):seq(a(n), n=1..70); # Zerinvary Lajos, Apr 07 2009

LinearRecurrence[{1,0,0,0,0,0,1,-1},{0,1,3,6,10,15,21,21},70] (* Harvey P. Dale, Jul 30 2017 *)

concat(0,Vec((1-7*x^6+6*x^7)/(1-x^7)/(1-x)^3+O(x^70))) \\ Charles R Greathouse IV, Dec 22 2011

def A130485_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(x*(1-7*x^6+6*x^7)/((1-x^7)*(1-x)^3)).list()
A130485_list(70) # G. C. Greubel, Aug 31 2019

a(n) = 21*floor(n/7) + A010876(n)*(A010876(n) + 1)/2.
G.f.: (Sum_{k=1..6} k*x^k)/((1-x^7)*(1-x)).
G.f.: x*(1 - 7*x^6 + 6*x^7)/((1-x^7)*(1-x)^3).

A097325 Period 6: repeat [0, 1, 1, 1, 1, 1].

Original entry on oeis.org

0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1

Offset: 0

Ralf Stephan, Aug 16 2004

a(n) is 0 if 6 divides n, 1 otherwise.

Antti Karttunen, Table of n, a(n) for n = 0..26244
Index entries for characteristic functions
Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,1).

Characteristic sequence of A047253.
Binary complement of A079979.
Cf. A010875, A168185, A145568, A168184, A168182, A168181, A109720, A011558, A166486, A011655, A000035.

[Sign(n mod 6) : n in [0..50]]; // Wesley Ivan Hurt, Jun 20 2014

seq(signum(k mod 6), k=0..100); # Wesley Ivan Hurt, Jun 29 2013

Table[Boole[Not[Divisible[n, 6]]], {n, 0, 89}] (* Alonso del Arte, Oct 21 2013 *)
PadRight[{}, 120, {0, 1, 1, 1, 1, 1}] (* Michael De Vlieger, Dec 22 2017 *)

PARI
```
a(n) = sign(n%6);
```

(define (A097325 n) (if (zero? (modulo n 6)) 0 1)) ;; Antti Karttunen, Dec 22 2017

G.f.: 1/(1-x) - 1/(1-x^6) = Sum_{k>=0} x^k - x^(6*k).
Recurrence: a(n+6) = a(n), a(0) = 0, a(i) = 1, 1 <= i <= 5.
a(n) = (1/4) * (3 - (-1)^n - (-1)^((n+1)/3) - (-1)^((2n+1)/3)).
From Reinhard Zumkeller, Nov 30 2009: (Start)
a(n) = 1 - A079979(n).
a(A047253(n)) = 1, a(A008588(n)) = 0.
A033438(n) = Sum_{k=0..n} a(k)*(n-k). (End)
Dirichlet g.f.: (1 - 1/6^s)*zeta(s). - R. J. Mathar, Feb 19 2011
For the general case: the characteristic function of numbers that are not multiples of m is a(n) = floor((n-1)/m) - floor(n/m) + 1, m, n > 0. - Boris Putievskiy, May 08 2013
a(n) = sign(n mod 6). - Wesley Ivan Hurt, Jun 29 2013
a(n) = ceiling(5n/6) - floor(5n/6). - Wesley Ivan Hurt, Jun 20 2014

New name from Omar E. Pol, Oct 21 2013

A130486 a(n) = Sum_{k=0..n} (k mod 8) (Partial sums of A010877).

Original entry on oeis.org

0, 1, 3, 6, 10, 15, 21, 28, 28, 29, 31, 34, 38, 43, 49, 56, 56, 57, 59, 62, 66, 71, 77, 84, 84, 85, 87, 90, 94, 99, 105, 112, 112, 113, 115, 118, 122, 127, 133, 140, 140, 141, 143, 146, 150, 155, 161, 168, 168, 169, 171, 174, 178, 183, 189, 196, 196, 197, 199, 202, 206

Offset: 0

Hieronymus Fischer, May 31 2007

Let A be the Hessenberg n X n matrix defined by A[1,j] = j mod 8, A[i,i]:=1, A[i,i-1]=-1. Then, for n >= 1, a(n)=det(A). - Milan Janjic, Jan 24 2010

Shawn A. Broyles, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,1,-1).

Cf. A010872, A010873, A010874, A010875, A010876, A010878. A130481, A130482, A130483, A130484, A130485, A130487.

a:=[0,1,3,6,10,15,21,28,28];; for n in [10..71] do a[n]:=a[n-1]+a[n-8]-a[n-9]; od; a; # G. C. Greubel, Aug 31 2019

I:=[0,1,3,6,10,15,21,28,28]; [n le 9 select I[n] else Self(n-1) + Self(n-8) - Self(n-9): n in [1..71]]; // G. C. Greubel, Aug 31 2019

seq(coeff(series(x*(1-8*x^7+7*x^8)/((1-x^8)*(1-x)^3), x, n+1), x, n), n = 0 .. 40); # G. C. Greubel, Aug 31 2019

Array[28 Floor[#1/8] + #2 (#2 + 1)/2 & @@ {#, Mod[#, 8]} &, 61, 0] (* Michael De Vlieger, Apr 28 2018 *)
Accumulate[PadRight[{},100,Range[0,7]]] (* Harvey P. Dale, Dec 21 2018 *)

a(n) = sum(k=0, n, k % 8); \\ Michel Marcus, Apr 28 2018

def A130486_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(x*(1-8*x^7+7*x^8)/((1-x^8)*(1-x)^3)).list()
A130486_list(70) # G. C. Greubel, Aug 31 2019

a(n) = 28*floor(n/8) + A010877(n)*(A010877(n) + 1)/2.
G.f.: (Sum_{k=1..7} k*x^k)/((1-x^8)*(1-x)).
G.f.: x*(1 - 8*x^7 + 7*x^8)/((1-x^8)*(1-x)^3).

A010881 Simple periodic sequence: n mod 12.

Original entry on oeis.org

0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11

Offset: 0

N. J. A. Sloane

The value of the rightmost digit in the base-12 representation of n. - Hieronymus Fischer, Jun 11 2007

			a(27) = 3 since 27 = 12*2+3.

Index entries for linear recurrences with constant coefficients, signature (0,0,0,0,0,0,0,0,0,0,0,1).

Partial sums: A130490. Other related sequences A130481, A130482, A130483, A130484, A130485, A130486, A130487, A130488, A130489.

Mod[Range[0, 100], 12] (* Paolo Xausa, Feb 02 2024 *)

A010881(n)=n%12 \\ M. F. Hasler, Sep 25 2014

From Hieronymus Fischer, May 31 2007: (Start)
a(n) = n mod 12.
Complex representation: a(n) = (1/12)*(1-r^n)*Sum_{k=1..11} k*Product_{m=1..11, m<>k} (1-r^(n-m)) where r = exp(Pi/6*i) = (sqrt(3)+i)/2 and i = sqrt(-1).
Trigonometric representation: a(n) = (512/3)^2*(sin(n*Pi/12))^2*Sum_{k=1..11} k*Product_{m=1..11, m<>k} (sin((n-m)*Pi/12))^2.
G.f.: (Sum_{k=1..11} k*x^k)/(1-x^12).
G.f.: x*(11*x^12-12*x^11+1)/((1-x^12)*(1-x)^2). (End)
From Hieronymus Fischer, Jun 11 2007: (Start)
a(n) = (n mod 2)+2*(floor(n/2) mod 6) = A000035(n)+2*A010875(A004526(n)).
a(n) = (n mod 3)+3*(floor(n/3) mod 4) = A010872(n)+3*A010873(A002264(n)).
a(n) = (n mod 4)+4*(floor(n/4) mod 3) = A010873(n)+4*A010872(A002265(n)).
a(n) = (n mod 6)+6*(floor(n/6) mod 2) = A010875(n)+6*A000035(A152467(n)).
a(n) = (n mod 2)+2*(floor(n/2) mod 2)+4*(floor(n/4) mod 3) = A000035(n)+2*A000035(A004526(n))+4*A010872(A002265(n)). (End)
a(A001248(k) + 17) = 6 for k>2. - Reinhard Zumkeller, May 12 2010
a(n) = A034326(n+1)-1. - M. F. Hasler, Sep 25 2014

A117373 Expansion of (1 - 3x)/(1 - x + x^2).

Original entry on oeis.org

1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1, -2, -3, -1, 2, 3, 1

Offset: 0

Paul Barry, Mar 10 2006

Row sums of number triangle A117372.

Periodic sequence with period {1, -2, -3, -1, 2, 3}. - Philippe Deléham, Nov 03 2008

Tanya Khovanova, Recursive Sequences
Index entries for linear recurrences with constant coefficients, signature (1,-1).

Cf. A010892, A117372.

Cf. A010872 (n mod 3), A010875 (n mod 6).

CoefficientList[Series[(1 - 3 x)/(1 - x + x^2), {x, 0, 200}], x] (* Vladimir Joseph Stephan Orlovsky, Jun 11 2011 *)

Vec((1-3*x)/(1-x+x^2) + O(x^90)) \\ Michel Marcus, Apr 06 2016

G.f.: (1 - 3x)/(1 - x + x^2).
a(n) = Sum_{k=0..n} (-1)^(n-k)*(C(k,n-k) + 3*C(k, n-k-1)).
a(n) = a(n-1) - a(n-2); a(0)=1, a(1)=-2. - Philippe Deléham, Nov 03 2008
a(n) = A010892(n) - 3*A010892(n-1). - R. J. Mathar, Sep 14 2013
a(n) = cos(n*Pi/3) - 5*sin(n*Pi/3)/sqrt(3). - Andres Cicuttin, Apr 06 2016
a(n) = ((n mod 3)^2 - 4*(n mod 3) + 1)*(-1)^floor(n/3). - Luce ETIENNE, Nov 18 2017

A010073 a(n) = sum of base-6 digits of a(n-1) + sum of base-6 digits of a(n-2); a(0)=0, a(1)=1.

Original entry on oeis.org

0, 1, 1, 2, 3, 5, 8, 8, 6, 4, 5, 9, 9, 8, 7, 5, 7, 7, 4, 6, 5, 6, 6, 2, 3, 5, 8, 8, 6, 4, 5, 9, 9, 8, 7, 5, 7, 7, 4, 6, 5, 6, 6, 2, 3, 5, 8, 8, 6, 4, 5, 9, 9, 8, 7, 5, 7, 7, 4, 6, 5, 6, 6, 2, 3, 5, 8, 8, 6, 4, 5, 9, 9, 8, 7, 5, 7, 7, 4, 6, 5, 6, 6

Offset: 0

N. J. A. Sloane, Leonid Broukhis

The digital sum analog (in base 6) of the Fibonacci recurrence. - Hieronymus Fischer, Jun 27 2007
For general bases p > 2, we have the inequality 2 <= a(n) <= 2p-3 (for n > 2). Actually, a(n) <= 9 = A131319(6) for the base p=6. - Hieronymus Fischer, Jun 27 2007
a(n) and Fibonacci(n)=A000045(n) are congruent modulo 5 which implies that (a(n) mod 5) is equal to (Fibonacci(n) mod 5) = A082116(n) (for n > 0). Thus (a(n) mod 6) is periodic with the Pisano period A001175(5)=20. - Hieronymus Fischer, Jun 27 2007

Index entries for Colombian or self numbers and related sequences

Cf. A000045, A010074, A010075, A010076, A010077, A131294, A131295, A131296, A131297, A131318, A131319, A131320.

[0] cat [n le 2 select 1 else Self(n-1)+Self(n-2)-5*((Self(n-1) div 6)+(Self(n-2) div 6)): n in [1..100]]; // Vincenzo Librandi, Jul 11 2015

nxt[{a_,b_,c_}]:={b,c,Total[IntegerDigits[c,6]]+Total[ IntegerDigits[ b,6]]}; Transpose[NestList[nxt,{0,1,1},90]][[1]] (* Harvey P. Dale, Oct 09 2014 *)

lista(nn) = {va = vector(nn); va[2] = 1; for (n=3, nn, va[n] = sumdigits(va[n-1], 6) + sumdigits(va[n-2], 6);); va;} \\ Michel Marcus, Apr 24 2018

Periodic from n=3 with period 20. - Franklin T. Adams-Watters, Mar 13 2006
a(n) = a(n-1) + a(n-2) - 5*(floor(a(n-1)/6) + floor(a(n-2)/6)). - Hieronymus Fischer, Jun 27 2007
a(n) = floor(a(n-1)/6) + floor(a(n-2)/6) + (a(n-1) mod 6) + (a(n-2) mod 6). - Hieronymus Fischer, Jun 27 2007
a(n) = (a(n-1) + a(n-2) + 5*(A010875(a(n-1)) + A010875(a(n-2))))/6. - Hieronymus Fischer, Jun 27 2007
a(n) = Fibonacci(n) - 5*Sum_{k=2..n-1} Fibonacci(n-k+1)*floor(a(k)/6). - Hieronymus Fischer, Jun 27 2007

Incorrect comment removed by Michel Marcus, Apr 28 2018

A130487 a(n) = Sum_{k=0..n} (k mod 9) (Partial sums of A010878).

Original entry on oeis.org

0, 1, 3, 6, 10, 15, 21, 28, 36, 36, 37, 39, 42, 46, 51, 57, 64, 72, 72, 73, 75, 78, 82, 87, 93, 100, 108, 108, 109, 111, 114, 118, 123, 129, 136, 144, 144, 145, 147, 150, 154, 159, 165, 172, 180, 180, 181, 183, 186, 190, 195, 201, 208, 216, 216, 217, 219, 222, 226

Offset: 0

Hieronymus Fischer, May 31 2007

Let A be the Hessenberg n X n matrix defined by A[1,j]=j mod 9, A[i,i]:=1, A[i,i-1]=-1. Then, for n >= 1, a(n)=det(A). - Milan Janjic, Jan 24 2010

Shawn A. Broyles, Table of n, a(n) for n = 0..1000
Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,0,0,0,1,-1).

Cf. A010872, A010873, A010874, A010875, A010876, A010877, A130481, A130482, A130483, A130484, A130485, A130486.

a:=[0,1,3,6,10,15,21,28,36,36];; for n in [11..71] do a[n]:=a[n-1]+a[n-9]-a[n-10]; od; a; # G. C. Greubel, Aug 31 2019

I:=[0,1,3,6,10,15,21,28,36,36]; [n le 10 select I[n] else Self(n-1) + Self(n-9) - Self(n-10): n in [1..71]]; // G. C. Greubel, Aug 31 2019

seq(coeff(series(x*(1-9*x^8+8*x^9)/((1-x^9)*(1-x)^3), x, n+1), x, n), n = 0 .. 70); # G. C. Greubel, Aug 31 2019

Accumulate[PadRight[{},120,Range[0,8]]] (* Harvey P. Dale, Dec 19 2018 *)
Accumulate[Mod[Range[0,100],9]] (* Harvey P. Dale, Oct 16 2021 *)

a(n) = sum(k=0, n, k % 9); \\ Michel Marcus, Apr 28 2018

def A130487_list(prec):
    P. = PowerSeriesRing(ZZ, prec)
    return P(x*(1-9*x^8+8*x^9)/((1-x^9)*(1-x)^3)).list()
A130487_list(70) # G. C. Greubel, Aug 31 2019

a(n) = 36*floor(n/9) + A010878(n)*(A010878(n) + 1)/2.
G.f.: (Sum_{k=1..8} k*x^k)/((1-x^9)*(1-x)).
G.f.: x*(1 - 9*x^8 + 8*x^9)/((1-x^9)*(1-x)^3).

A358840 Primorial base exp-function reduced modulo 6.

Original entry on oeis.org

1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 1, 2, 3, 0, 3, 0, 5, 4, 3, 0, 3, 0, 1, 2, 3, 0

Offset: 0

Antti Karttunen, Dec 02 2022

nonn

Antti Karttunen, Table of n, a(n) for n = 0..65537
Index entries for sequences related to primorial base

Cf. A010875, A276086, A328632 (positions of 1's), A358841 (their characteristic function), A047235 (positions of 3's), A120325 (their char. fun), A358843 (positions of 5's), A358842 (their char. fun).

Cf. also A353486, A358850.

A358840(n) = { my(m=1, p=2); while(n, m *= (p^(n%p)); n = n\p; p = nextprime(1+p)); (m%6); };

a(n) = A010875(A276086(n)) = A276086(n) mod 6.

A010883 Simple periodic sequence: repeat 1,2,3,4.

Original entry on oeis.org

1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1, 2, 3, 4, 1

Offset: 0

N. J. A. Sloane

Partial sums are given by A130482(n) + n + 1. - Hieronymus Fischer, Jun 08 2007

1234/9999 = 0.123412341234... - Eric Desbiaux, Nov 03 2008

Index entries for linear recurrences with constant coefficients, signature (0,0,0,1).

Cf. A010872, A010873, A010874, A010875, A010876, A004526, A002264, A002265, A002266.

Cf. A177037 (decimal expansion of (9+2*sqrt(39))/15). - Klaus Brockhaus, May 01 2010

PadRight[{},120,{1,2,3,4}] (* Harvey P. Dale, Aug 02 2016 *)

a(n)=(n-1)%4+1 \\ Charles R Greathouse IV, Jun 11 2015

def A010883(n): return 1 + (n & 3) # Chai Wah Wu, May 25 2022

a(n) = 1 + (n mod 4). - Paolo P. Lava, Nov 21 2006
From Hieronymus Fischer, Jun 08 2007: (Start)
a(n) = A010873(n) + 1.
Also a(n) = (1/2)*(5 - (-1)^n - 2*(-1)^((2*n - 1 + (-1)^n)/4)).
G.f.: g(x) = (4*x^3 + 3*x^2 + 2*x + 1)/(1 - x^4) = (4*x^5 - 5*x^4 + 1)/((1 - x^4)*(1-x)^2). (End)
a(n) = 5/2 - cos(Pi*n/2) - sin(Pi*n/2) - (-1)^n/2. - R. J. Mathar, Oct 08 2011

A154811 a(n) = Fibonacci(2*n+1) mod 9.

Original entry on oeis.org

1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1, 1, 2, 5, 4, 7, 8, 8, 7, 4, 5, 2, 1

Offset: 0

Paul Curtz, Jan 15 2009

Periodic with period length 12.

Index entries for linear recurrences with constant coefficients, signature (1,0,0,0,0,-1,1).

Cf. A010689, A010875.

Mod[Fibonacci[Range[1,151,2]],9] (* Harvey P. Dale, Jul 10 2018 *)

a(n)=fibonacci(n%12*2+1)%9 \\ Charles R Greathouse IV, Dec 21 2011

a(n) = A001519(n+1) mod 9 = A122367(n) mod 9 = |A099496(n)| mod 9.
From R. J. Mathar, Apr 10 2009: (Start)
a(n) = a(n-1) - a(n-6) + a(n-7).
G.f.: -(1 + x + 3*x^2 - x^3 + 3*x^4 + x^5 + x^6)/((x - 1)*(x^2 + 1)*(x^4 - x^2 + 1)). (End)

Edited by R. J. Mathar, Jan 23 2009

Typo in A-number in first formula corrected by R. J. Mathar, Feb 23 2009

cp's OEIS Frontend

A130485 a(n) = Sum_{k=0..n} (k mod 7) (Partial sums of A010876).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A097325 Period 6: repeat [0, 1, 1, 1, 1, 1].

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Maple

Mathematica

PARI

Scheme

Formula

Extensions

A130486 a(n) = Sum_{k=0..n} (k mod 8) (Partial sums of A010877).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

GAP

Magma

Maple

Mathematica

PARI

Sage

Formula

A010881 Simple periodic sequence: n mod 12.

Views

Author

Keywords

Comments

Examples

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A117373 Expansion of (1 - 3x)/(1 - x + x^2).

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Mathematica

PARI

Formula

A010073 a(n) = sum of base-6 digits of a(n-1) + sum of base-6 digits of a(n-2); a(0)=0, a(1)=1.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Magma

Mathematica

PARI