Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A072594
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A072594 In prime factorization of n replace multiplication by bitwise logical 'xor'. +0
6
1, 2, 3, 0, 5, 1, 7, 2, 0, 7, 11, 3, 13, 5, 6, 0, 17, 2, 19, 5, 4, 9, 23, 1, 0, 15, 3, 7, 29, 4, 31, 2, 8, 19, 2, 0, 37, 17, 14, 7, 41, 6, 43, 11, 5, 21, 47, 3, 0, 2, 18, 13, 53, 1, 14, 5, 16, 31, 59, 6, 61, 29, 7, 0, 8, 10, 67, 17, 20, 0, 71, 2, 73, 39, 3, 19, 12, 12, 79, 5, 0, 43, 83, 4 (list; graph; listen)
OFFSET

1,2

COMMENT

n is prime iff a(n)=n;

for primes p, k>0: a(p^k)=p*(k mod 2);

for m>1: a(m^2)=0, see A072595.

a(A127812(n)) = n and a(m) <> n for m < A127812(n).

LINKS

R. Zumkeller, Table of n, a(n) for n = 1..10000

EXAMPLE

a(35) = a(5*7) = a(5) 'xor' a(7) = '101' xor '111' = '010' = 2.

CROSSREFS

Cf. A072591, A072593.

Adjacent sequences: A072591 A072592 A072593 this_sequence A072595 A072596 A072597

Sequence in context: A140664 A071321 A071322 this_sequence A074722 A080368 A057174

KEYWORD

nonn,nice

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jun 23 2002

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 October 7 14:39 EDT 2008. Contains 144666 sequences.


AT&T Labs Research