Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A055259
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A055259 Sums of two powers of 8. +0
1
2, 9, 16, 65, 72, 128, 513, 520, 576, 1024, 4097, 4104, 4160, 4608, 8192, 32769, 32776, 32832, 33280, 36864, 65536, 262145, 262152, 262208, 262656, 266240, 294912, 524288, 2097153, 2097160, 2097216, 2097664, 2101248, 2129920, 2359296 (list; table; graph; listen)
OFFSET

1,1

FORMULA

a(n) = 8^(n-trinv(n))+8^trinv(n), where trinv(n) = floor((1+sqrt(1+8*n))/2) = A002262(n) and n-trinv(n) = A003056(n)

Regarded as a triangle T(n, k)=8^n+8^k, so as a sequence a(n) =8^A002262(n)+8^A003056(n).

EXAMPLE

a(4) = 72 = 8^2+8^1

CROSSREFS

Cf. A052216.

Sequence in context: A101420 A097965 A075645 this_sequence A032299 A032211 A032136

Adjacent sequences: A055256 A055257 A055258 this_sequence A055260 A055261 A055262

KEYWORD

base,easy,nonn,tabl

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Jun 22 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 21 14:49 EST 2008. Contains 150807 sequences.


AT&T Labs Research