login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the new OEIS web site. 70,000 sequences have been added in these four years, all edited by volunteers. Please make a donation (tax deductible in the US) to help keep the OEIS running.

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A080031 a(n) is taken to be the smallest positive integer not already present which is consistent with the condition "n is a member of the sequence if and only if a(n) is congruent to 2 mod 3". 3
1, 2, 5, 4, 8, 11, 7, 14, 17, 10, 20, 23, 13, 26, 29, 16, 32, 35, 19, 38, 41, 22, 44, 47, 25, 50, 53, 28, 56, 59, 31, 62, 65, 34, 68, 71, 37, 74, 77, 40, 80, 83, 43, 86, 89, 46, 92, 95, 49, 98, 101, 52, 104, 107, 55, 110, 113, 58, 116, 119, 61, 122, 125, 64, 128, 131, 67 (list; graph; refs; listen; history; text; internal format)
OFFSET

0,2

COMMENTS

A permutation of all positive non-multiples of 3; also a permutation of A080030. - Matthew Vandermast, Mar 21 2003

LINKS

Table of n, a(n) for n=0..66.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence, J. Integer Seqs., Vol. 6 (2003), #03.2.2.

B. Cloitre, N. J. A. Sloane and M. J. Vandermast, Numerical analogues of Aronson's sequence (math.NT/0305308)

FORMULA

a(3m)=3m+1, a(3m+1)=6m+2, a(3m+2)=6m-1.

CROSSREFS

Cf. A079000, A079313, A080029, A080030.

Sequence in context: A134079 A243973 A183542 * A198193 A214533 A065221

Adjacent sequences:  A080028 A080029 A080030 * A080032 A080033 A080034

KEYWORD

easy,nonn

AUTHOR

N. J. A. Sloane, Mar 14 2003

EXTENSIONS

More terms from Matthew Vandermast, Mar 21 2003

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified November 23 00:51 EST 2014. Contains 249836 sequences.