login
This site is supported by donations to The OEIS Foundation.
Logo

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A119565 a(0)=1, a(1)=2, a(2)=3, a(3)=5, a(4)=7, a(5)=10; a(n) = floor(a(n-1) + 1 + a(n-2)/6) for n>=6. 2
1, 2, 3, 5, 7, 10, 12, 14, 17, 20, 23, 27, 31, 36, 42, 49, 57, 66, 76, 88, 101, 116, 133, 153, 176, 202, 232, 266, 305, 350, 401, 460, 527, 604, 692, 793, 909, 1042, 1194, 1368, 1568, 1797, 2059, 2359, 2703, 3097, 3548, 4065, 4657, 5335, 6112, 7002, 8021 (list; graph; refs; listen; history; internal format)
OFFSET

0,2

MATHEMATICA

a[0]=1; a[1]=2; a[2]=3; a[3]=5; a[4]=7; a[5]=10; a[n_]:=a[n]=Floor[a[n-1]+1+a[n-2]/6];

PROG

(PARI) a=concat([1, 2, 3, 5, 7, 10], vector(95)); for(i=7, #a, a[i]=1+a[i-1]+a[i-2]\6); a \\ Charles R Greathouse IV, Nov 07 2011

CROSSREFS

Cf. A119592.

Sequence in context: A144726 A123885 A010062 * A119592 A191892 A087539

Adjacent sequences:  A119562 A119563 A119564 * A119566 A119567 A119568

KEYWORD

nonn

AUTHOR

Roger Bagula, May 31 2006

EXTENSIONS

More terms from Zak Seidov, May 31 2006

Edited by N. J. A. Sloane (njas(AT)research.att.com), Jun 03 2006

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Puzzles | Hot | Classics
Recent Additions | More pages | Superseeker | Maintained by The OEIS Foundation Inc.

Content is available under The OEIS End-User License Agreement .

Last modified February 16 10:53 EST 2012. Contains 205904 sequences.