Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A097046
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A097046 a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1; a(1) = 1. +0
2
1, 2, 3, 5, 7, 9, 11, 13, 16, 19, 22, 25, 28, 31, 34, 39, 44, 49, 54, 59, 64, 69, 74, 79, 86, 93, 100, 107, 114, 121, 128, 135, 142, 149, 156, 165, 174, 183, 192, 201, 210, 219, 228, 237, 246, 255, 264, 273, 284, 295, 306, 317, 328, 339, 350, 361, 372, 383, 394, 405 (list; graph; listen)
OFFSET

1,2

COMMENT

By definition, this sequence consists of an infinite sequence of finite subsequences of increasing lengths with common differences a(1), a(2), a(3), ..., respectively.

FORMULA

a(1)=1; a(n) = a(n-1) + a(floor(sqrt(n))) for n > 1.

CROSSREFS

Cf. A097045 ( a(n-1) - a(floor(sqrt(n))) ).

Sequence in context: A096149 A033055 A022554 this_sequence A011861 A065520 A090332

Adjacent sequences: A097043 A097044 A097045 this_sequence A097047 A097048 A097049

KEYWORD

nonn

AUTHOR

Rick L. Shepherd (rshepherd2(AT)hotmail.com), Jul 20 2004

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