Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A060582
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A060582 If the final digit of n in base 3 is the same as a([n/3]) then this digit, otherwise a(n)= mod 3-sum of these two digits, with a(0)=0. +0
3
0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2, 2, 1, 0, 2, 1, 0, 0, 2, 1, 1, 0, 2, 1, 0, 2, 2, 1, 0, 0, 2, 1, 0, 2, 1, 1, 0, 2 (list; graph; listen)
OFFSET

0,2

LINKS

Index entries for sequences related to final digits of numbers

FORMULA

a(n) =(-a([n/3])-n) mod 3 =A060583(n) mod 3.

EXAMPLE

a(4)=0 since a([4/3])=a(1)=2, (4 mod 3)=1 and 3-2-1=0. a(5)=2 since a([5/3])=a(1)=2 and (5 mod 3)=2.

CROSSREFS

Cf. A060588.

Sequence in context: A029375 A071462 A101979 this_sequence A060450 A025860 A058394

Adjacent sequences: A060579 A060580 A060581 this_sequence A060583 A060584 A060585

KEYWORD

base,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Apr 04 2001

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