Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A159970
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A159970 Lodumo_5 of A102370 (sloping binary numbers) . +0
1
0, 3, 1, 5, 4, 10, 15, 9, 8, 6, 14, 13, 18, 23, 28, 2, 11, 19, 7, 16, 20, 21, 26, 25, 24, 12, 30, 31, 29, 34, 39, 33, 17, 35, 38, 22, 36, 27, 32, 41, 40, 43, 46, 45, 50, 55, 60, 44, 48, 51, 49, 53, 37, 58, 63, 42, 56, 54, 61, 68, 66, 71, 76, 65, 59, 47, 70, 64 (list; graph; listen)
OFFSET

0,2

COMMENT

Permutation of nonnegative integers .

The Lodumo_m transformation of a sequence s(n) is defined by a(n) = smallest non-negative integer not yet in the list a(.) such that a(n)=s(n) (mod m). [From R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2009]

FORMULA

a(n)= lod_5 (A102370(n)).

CROSSREFS

Cf. A102370, A159059

Sequence in context: A152747 A010847 A082129 this_sequence A096374 A007085 A094648

Adjacent sequences: A159967 A159968 A159969 this_sequence A159971 A159972 A159973

KEYWORD

easy,nonn

AUTHOR

Philippe DELEHAM (kolotoko(AT)wanadoo.fr), Apr 28 2009

EXTENSIONS

Corrected by R. J. Mathar (mathar(AT)strw.leidenuniv.nl), Apr 30 2009

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 December 10 00:48 EST 2009. Contains 170565 sequences.


AT&T Labs Research