Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A127961
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A127961 A007583(n) written in binary. +0
7
1, 11, 1011, 101011, 10101011, 1010101011, 101010101011, 10101010101011, 1010101010101011, 101010101010101011, 10101010101010101011, 1010101010101010101011, 101010101010101010101011 (list; graph; listen)
OFFSET

0,2

EXAMPLE

A007583(2) = 11, which becomes 1011 when written in binary.

MATHEMATICA

Table[FromDigits[IntegerDigits[(2^(2n + 1) + 1)/3, 2]], {n, 0, 14}]

CROSSREFS

Cf. A007583.

Sequence in context: A052071 A083816 A004656 this_sequence A127962 A006938 A015511

Adjacent sequences: A127958 A127959 A127960 this_sequence A127962 A127963 A127964

KEYWORD

easy,nonn,less

AUTHOR

Artur Jasinski (grafix(AT)csl.pl), Feb 09 2007

EXTENSIONS

Edited and extended by Stefan Steinerberger (stefan.steinerberger(AT)gmail.com), Jun 11 2007

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 July 24 12:00 EDT 2008. Contains 142294 sequences.


AT&T Labs Research