Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A107320
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A107320 a(1)=1 then a(n)=f(n)-a(f(n))+a(f(n)-a(f(n))) where f(n)=floor(n/2). +0
1
1, 1, 1, 2, 2, 3, 3, 3, 3, 4, 4, 4, 4, 6, 6, 7, 7, 9, 9, 9, 9, 10, 10, 11, 11, 12, 12, 11, 11, 12, 12, 12, 12, 14, 14, 12, 12, 14, 14, 15, 15, 16, 16, 16, 16, 17, 17, 17, 17, 20, 20, 20, 20, 21, 21, 24, 24, 27, 27, 27, 27, 28, 28, 29, 29, 30, 30, 29, 29, 30, 30, 35, 35, 36, 36, 35 (list; graph; listen)
OFFSET

1,4

FORMULA

a(n)=(sqrt(2)-1)*n+o(n) (?)

PROGRAM

(PARI) a(n)=if(n<2, 1, floor(n/2)-a(floor(n/2))+a(floor(n/2)-a(floor(n/2))))

CROSSREFS

Sequence in context: A106457 A103128 A156080 this_sequence A095186 A101402 A156251

Adjacent sequences: A107317 A107318 A107319 this_sequence A107321 A107322 A107323

KEYWORD

nonn

AUTHOR

Benoit Cloitre (benoit7848c(AT)orange.fr), May 21 2005

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 29 12:46 EST 2009. Contains 167659 sequences.


AT&T Labs Research