Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A030130
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A030130 Binary expansion contains a single 0. +0
3
0, 2, 5, 6, 11, 13, 14, 23, 27, 29, 30, 47, 55, 59, 61, 62, 95, 111, 119, 123, 125, 126, 191, 223, 239, 247, 251, 253, 254, 383, 447, 479, 495, 503, 507, 509, 510, 767, 895, 959, 991, 1007, 1015, 1019, 1021, 1022, 1535, 1791, 1919, 1983, 2015, 2031, 2039 (list; graph; listen)
OFFSET

0,2

FORMULA

a(n) = 2^(g(n))-1-2^(((2*g(n)-1)^2-1-8*n)/8) with g(n)=int((sqrt(8*n-7)+3)/2) for all n>0 and g(0)=1 - UlrSchimke(AT)aol.com.

EXAMPLE

23 is OK because it is '10111' in base 2.

PROGRAM

(C) long int element (long int i) { return (pow(2, g(i))-1-pow(2, (pow(2*g(i)-1, 2)-1-8*i)/8)); } long int g(long int m) {if (m==0) return(1); return ((sqrt(8*m-7)+3)/2); }

CROSSREFS

Adjacent sequences: A030127 A030128 A030129 this_sequence A030131 A030132 A030133

Sequence in context: A026344 A057812 A140144 this_sequence A045845 A002133 A092306

KEYWORD

nonn,base,easy

AUTHOR

Toby Donaldson (tjdonald(AT)uwaterloo.ca)

EXTENSIONS

More terms from Erich Friedman (erich.friedman(AT)stetson.edu).

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