Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A068222
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A068222 An auxiliary bit-mask sequence for computing A066425. (The "dirty", unsymmetric one). +0
6
1, 3, 27, 6943, 1819024347, 4000076419257964896255, 77372730618755190082837640024229164347468807163, 23714672931571990907468553360528961124510050101533926414303807152598184073416100\ 7646995989118658281471 (list; graph; listen)
OFFSET

1,2

LINKS

A. Karttunen, Scheme functions for computing A066425 and related sequences.

FORMULA

A068222(1)=1, A068222(n) = A068221(n) | (A068222(n-1) >> A068058(n-1)) [where | means bitwise or and >> is binary right shift]

CROSSREFS

The corresponding "clean" bit-mask sequence is A068221. This sequence in binary: A068224. The width of these bit-masks is given by A068739. The position of the rightmost zero bit: A068058. The width of central gap of the term a(n), (n>1) is given by A068059(n-1)-1 = 0, 1, 3, 5, 10, 12, ... (i.e. partial sums of A068058).

Sequence in context: A122215 A122217 A068221 this_sequence A055777 A014222 A162414

Adjacent sequences: A068219 A068220 A068221 this_sequence A068223 A068224 A068225

KEYWORD

nonn

AUTHOR

Antti Karttunen (firstname.surname ), Feb 26 2002

page 1

Search completed in 0.003 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 22 20:51 EST 2009. Contains 167312 sequences.


AT&T Labs Research