Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A130508
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A130508 a(1)=2. a(2)=3. a(3)=1. a(n+3) = 3 + a(n), for all positive integers n. +0
2
2, 3, 1, 5, 6, 4, 8, 9, 7, 11, 12, 10, 14, 15, 13, 17, 18, 16, 20, 21, 19, 23, 24, 22, 26, 27, 25, 29, 30, 28, 32, 33, 31, 35, 36, 34, 38, 39, 37, 41, 42, 40, 44, 45, 43, 47, 48, 46 (list; graph; listen)
OFFSET

1,1

COMMENT

This sequence is a permutation of the positive integers, where each a(n) is the smallest positive integer not occurring earlier in the sequence such that the m-th term of the inverse permutation A130509 never equals a(m), for all positive integers m.

CROSSREFS

Cf. A130509.

Sequence in context: A060116 A114690 A049274 this_sequence A055231 A072400 A007913

Adjacent sequences: A130505 A130506 A130507 this_sequence A130509 A130510 A130511

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Jun 01 2007

page 1

Search completed in 0.002 seconds

Lookup | Welcome | Find friends | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
More pages | Superseeker | Maintained by N. J. A. Sloane (njas@research.att.com)

Last modified August 29 17:54 EDT 2008. Contains 143238 sequences.


AT&T Labs Research