Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A064323
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
A064323 a(n)=a(n-1)+ceiling[a(n-2)/2] with a(0)=0 and a(1)=1. +0
1
0, 1, 1, 2, 3, 4, 6, 8, 11, 15, 21, 29, 40, 55, 75, 103, 141, 193, 264, 361, 493, 674, 921, 1258, 1719, 2348, 3208, 4382, 5986, 8177, 11170, 15259, 20844, 28474, 38896, 53133, 72581, 99148, 135439, 185013, 252733, 345240, 471607, 644227, 880031 (list; graph; listen)
OFFSET

0,4

COMMENT

a(5)=a(4)+ceiling[a(3)/2]=3+ceiling[2/2]=4.

LINKS

Harry J. Smith, Table of n, a(n) for n=0,...,400

FORMULA

a(n) =A064324(n)-1. a(n)/a(n-1) approaches (1+sqrt(3))/2=1.3660254... for large n.

PROGRAM

(PARI) { for (n=0, 400, if (n>1, a=a1 + ceil(a2/2); a2=a1; a1=a, if (n, a=a1=1, a=a2=0)); write("b064323.txt", n, " ", a) ) } [From Harry J. Smith (hjsmithh(AT)sbcglobal.net), Sep 11 2009]

CROSSREFS

Sequence in context: A095814 A006683 A014213 this_sequence A003411 A034081 A064660

Adjacent sequences: A064320 A064321 A064322 this_sequence A064324 A064325 A064326

KEYWORD

nonn

AUTHOR

Henry Bottomley (se16(AT)btinternet.com), Sep 11 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research