Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064491
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064491 a(1) = 1, a(n+1) = a(n) + tau(a(n)). +0
10
1, 2, 4, 7, 9, 12, 18, 24, 32, 38, 42, 50, 56, 64, 71, 73, 75, 81, 86, 90, 102, 110, 118, 122, 126, 138, 146, 150, 162, 172, 178, 182, 190, 198, 210, 226, 230, 238, 246, 254, 258, 266, 274, 278, 282, 290, 298, 302, 306, 318, 326, 330, 346, 350, 362, 366, 374 (list; graph; listen)
OFFSET

1,2

LINKS

T. D. Noe, Table of n, a(n) for n=1..1000

FORMULA

It seems likely that there exist constants c_1 and c_2 such that c_1*n*log(n) < a(n) < c_2*n*log(n) for all sufficiently large n. - Franklin T. Adams-Watters, Jun 25 2008

CROSSREFS

Cf. A000005.

Sequence in context: A134886 A024193 A064550 this_sequence A120878 A137996 A080057

Adjacent sequences: A064488 A064489 A064490 this_sequence A064492 A064493 A064494

KEYWORD

nice,nonn

AUTHOR

Klaus Strassburger (strass(AT)ddfi.uni-duesseldorf.de), Oct 04 2001

EXTENSIONS

Beginning of sequence corrected by T. D. Noe, Sep 13 2007

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