Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A099811
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A099811 a(n) = a(n-1) XOR Sum_{k=1..n-1} a(k), with a(1)=1, a(2)=3, where XOR is the binary exclusive OR operation. +0
2
1, 3, 7, 12, 27, 41, 114, 191, 307, 908, 1479, 2517, 7218, 11819, 20079, 57564, 94035, 233905, 327970, 954519, 1356507, 3827708, 5462751, 15712989, 21207042, 61631203, 87045927, 251438028, 339057531, 986402633, 1392602162, 4023051167 (list; graph; listen)
OFFSET

1,2

EXAMPLE

a(3) = 7 since 3 XOR (3+1) = 3 XOR 4 = 7.

a(4) = 12 since 7 XOR (7+3+1) = 7 XOR 11 = 12.

a(5) = 27 since 12 XOR (12+7+3+1) = 12 XOR 23 = 27.

The binary expansions of a(n) form a triangle

(listed with ones-place in left-most column):

1,

1,1,

1,1,1,

0,0,1,1,

1,1,0,1,1,

1,0,0,1,0,1,

0,1,0,0,1,1,1,

1,1,1,1,1,1,0,1,

1,1,0,0,1,1,0,0,1,

0,0,1,1,0,0,0,1,1,1,

1,1,1,0,0,0,1,1,1,0,1,

1,0,1,0,1,0,1,1,1,0,0,1,...

PROGRAM

(PARI) a(n)=if(n==1, 1, if(n==2, 3, bitxor(a(n-1), sum(k=1, n-1, a(k)))))

CROSSREFS

Cf. A099810.

Sequence in context: A029452 A034434 A062325 this_sequence A063072 A007626 A047068

Adjacent sequences: A099808 A099809 A099810 this_sequence A099812 A099813 A099814

KEYWORD

nonn

AUTHOR

Paul D. Hanna (pauldhanna(AT)juno.com), Oct 26 2004

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 November 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research