Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056112
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A056112 a(1) = 1; a(m+1) = sum_{k=1 to m} [max(m, a(k))]. +0
1
1, 1, 4, 10, 22, 47, 97, 197, 397, 797, 1597, 3198, 6400, 12804, 25612, 51228, 102460, 204924, 409852, 819708, 1639420, 3278844, 6557692, 13115389, 26230783, 52461571, 104923147, 209846299, 419692603, 839385211, 1678770427 (list; graph; listen)
OFFSET

1,3

EXAMPLE

a(5) = max(4,1) + max(4,1) + max(4,4) + max(4,10) = 4 + 4 + 4 + 10 = 22.

CROSSREFS

Sequence in context: A099018 A033484 A008267 this_sequence A118430 A137247 A124697

Adjacent sequences: A056109 A056110 A056111 this_sequence A056113 A056114 A056115

KEYWORD

easy,nonn

AUTHOR

Leroy Quet (qq-quet(AT)mindspring.com), Aug 04 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 July 26 13:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research