0,2

Inverse binomial transform of A084858. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 12 2003

Earliest monotonic sequence starting with (1,2) and satisfying the condition : "a(n)+a(n-1) is not in the sequence" - Benoit Cloitre (benoit7848c(AT)orange.fr), Mar 25 2004

a(0) = 1; a(n) is least number which is relatively prime to the sum of all the previous terms. - Amarnath Murthy (amarnath_murthy(AT)yahoo.com), Jun 18 2001

For n>2, numbers having 3 as an anti-divisor. - Alexandre Wajnberg (alexandre.wajnberg(AT)skynet.be), Oct 02 2005

A011655(a(n)) = 1. [From Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Nov 30 2009]

L. Carlitz, R. Scoville and T. Vaughan, Some arithmetic functions related to Fibonacci numbers, Fib. Quart., 11 (1973), 337-386.

G. Ledin, Jr., Is Eratosthenes out?, Fib. Quart., 6 (No. 4, 1968), 261-265.

M. A. Nyblom, Some curious sequences ..., Am. Math. Monthly 109 (#6, 200), 559-564, Ex. 2.2.

N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973 (includes this sequence).

N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences, Academic Press, 1995 (includes this sequence).

A. S. Fraenkel, New games related to old and new sequences, INTEGERS, Electronic J. of Combinatorial Number Theory, Vol. 4, Paper G6, 2004. (See Table 5.)

G. P. Michon, Counting Polyhedra

S. Plouffe, Approximations de S\'{e}ries G\'{e}n\'{e}ratrices et Quelques Conjectures, Dissertation, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

S. Plouffe, 1031 Generating Functions and Conjectures, Universit\'{e} du Qu\'{e}bec \`{a} Montr\'{e}al, 1992.

Eric Weisstein's World of Mathematics, RATS Sequence

Index entries for sequences related to linear recurrences with constant coefficients

a(n) = 3+a(n-2). a(n) = a(n-1)+a(n-2)-a(n-3). a(2n) = 3n+1, a(2n-1) = 3n-1.

G.f.: (1+x+x^2)/((1-x)*(1-x^2)) - Michael Somos, Jun 08, 2000

a(n) = (4-n)*a(n-1)+2*a(n-2)+(n-3)*a(n-3) (from the Carlitz et al. article).

a(n)=Floor[(3n+2)/2]

a(1)=1, a(n) = 2*a(n-1)- 3*floor(a(n-1)/3). - Benoit Cloitre (benoit7848c(AT)orange.fr), Aug 17 2002

a(n) = 1 + n - n mod 2 + (n + n mod 2)/2. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 17 2002

a(0) = 1, a(n+1) = a(n) + a(n) mod 3. - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Mar 23 2003

a(0)=1, a(n)=3n-a(n-1). - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 12 2003

a(n)=3(2n+1)/4+(-1)^n/4 - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 12 2003

Nearest integer to sum(k>n, 1/k^3)/sum(k>n, 1/k^4) - Benoit Cloitre (benoit7848c(AT)orange.fr), Jun 12 2003

Partial sums of A040001. a(n)=A032766(n)-1. - Paul Barry (pbarry(AT)wit.ie), Sep 02 2003

a(n)=T(n+1, 1)=T(n+1, n), where T is the array in A026386. - Emeric Deutsch (deutsch(AT)duke.poly.edu), Feb 18 2004

a(n)=sqrt(3 A001082(n)+1 ) - Zak Seidov (zakseidov(AT)yahoo.com), Dec 12 2007

a(n) = A077043(n+1) - A077043(n). - Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Dec 28 2007

a(n) = A001477(n)+ A008619(n) - Yosu Yurramendi (yosu.yurramendi(AT)ehu.es), Aug 10 2008

Euler transform of length 3 sequence [ 2, 1, -1]. - Michael Somos Sep 06 2008

a(-1 - n) = -a(n).

1 + 2*x + 4*x^2 + 5*x^3 + 7*x^4 + 8*x^5 + 10*x^6 + 11*x^7 + 13*x^8 + ...

A001651 := n -> 3*floor((n+1)/2) + (-1)^n;

A001651:=(1+z+z**2)/(z+1)/(z-1)**2; [S. Plouffe in his 1992 dissertation.]

a[0]:=1:a[1]:=2:for n from 2 to 100 do a[n]:=a[n-2]+3 od: seq(a[n], n=0..69); - Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Mar 16 2008

(PARI) a(n)= 1+n+n\2

(Other) [i for i in range(105) if gcd(3, i) == 1] [From Zerinvary Lajos (zerinvarylajos(AT)yahoo.com), Apr 21 2009]

Differs from A059564 after 35= a(23)= A059564(24).

Cf. A026386, A001082.

Cf. A007494, A032766, A000726, A003105.

Sequence in context: A054386 A127450 A059564 this_sequence A003253 A119905 A161750

Adjacent sequences: A001648 A001649 A001650 this_sequence A001652 A001653 A001654

nonn,easy,new

N. J. A. Sloane (njas(AT)research.att.com).

Removed attribute "conjectured" from Plouffe g.f R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Mar 11 2009