Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A063510
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A063510 a(n) = a(floor(square root(n)) + 1. +0
2
1, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4 (list; graph; listen)
OFFSET

1,2

COMMENT

a(n) = A010096(n) until n = 255, but 5 = a(256) <> A010096(256) = 4

The least k such that a(k)=n for n>=2 is given by k=2^(2^(n-2)) so the closed form for a(n) follows. - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 28 2005

FORMULA

a(1)=1 for n>=2 a(n)=floor(log(4*log(n)/log(2))/log(2)) - Benoit Cloitre (benoit7848c(AT)orange.fr), Apr 28 2005

PROGRAM

(PARI) a(n)=if(n<2, 1, floor(log(4*log(n)/log(2))/log(2)))

CROSSREFS

A010096.

Sequence in context: A165024 A157639 A010096 this_sequence A156878 A140474 A091195

Adjacent sequences: A063507 A063508 A063509 this_sequence A063511 A063512 A063513

KEYWORD

easy,nonn

AUTHOR

Reinhard Zumkeller (reinhard.zumkeller(AT)gmail.com), Jul 30 2001

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 December 21 10:15 EST 2009. Contains 171081 sequences.


AT&T Labs Research