Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A053332
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A053332 a(n) contains n digits (either '4' or '7') and is divisible by 2^n. +0
1
4, 44, 744, 7744, 47744, 447744, 4447744, 44447744, 444447744, 4444447744, 74444447744, 474444447744, 4474444447744, 44474444447744, 444474444447744, 7444474444447744, 77444474444447744, 477444474444447744 (list; graph; listen)
OFFSET

1,1

FORMULA

a(n)=a(n-1)+10^(n-1)*(4+3*[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with a 4, if not then n-th term begins with a 7.

EXAMPLE

a(n)=a(n-1)+10^(n-1)*(4+[a(n-1)/2^(n-1) mod 2]) i.e. a(n) ends with a(n-1); if (n-1)-th term is divisible by 2^n then n-th term begins with a 2, if not then n-th term begins with a 7.

CROSSREFS

Cf. A023404, A050621, A050622, A035014.

Sequence in context: A053315 A005721 A056063 this_sequence A088594 A053333 A137783

Adjacent sequences: A053329 A053330 A053331 this_sequence A053333 A053334 A053335

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 August 19 23:53 EDT 2008. Contains 142930 sequences.


AT&T Labs Research