Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053317
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053317 a(n) contains n digits (either '2' or '5') and is divisible by 2^n. +0
2
2, 52, 552, 5552, 55552, 255552, 5255552, 55255552, 255255552, 2255255552, 22255255552, 222255255552, 5222255255552, 55222255255552, 255222255255552, 2255222255255552, 22255222255255552, 222255222255255552 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=a(n-1)+10^(n-1)*(2+3*[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends

CROSSREFS

Cf. A023398, A050621, A050622, A035014, A055880.

Sequence in context: A053455 A080921 A034311 this_sequence A123803 A101930 A099882

Adjacent sequences: A053314 A053315 A053316 this_sequence A053318 A053319 A053320

KEYWORD

base,nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Mar 06 2000

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 25 20:09 EST 2009. Contains 167514 sequences.


AT&T Labs Research