Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A119565
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
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. +0
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, 9189, 10526, 12058, 13813, 15823, 18126, 20764, 23786, 27247, 31212, 35754, 40957, 46917, 53744, 61564, 70522, 80783, 92537, 106001, 121424 (list; graph; listen)
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];

CROSSREFS

Cf. A119592.

Sequence in context: A117286 A123885 A010062 this_sequence A119592 A087539 A004684

Adjacent sequences: A119562 A119563 A119564 this_sequence A119566 A119567 A119568

KEYWORD

nonn

AUTHOR

Roger L. Bagula and Don Taylor (rlbagulatftn(AT)yahoo.com and dont(AT)agora.rdrop.com), May 31 2006

EXTENSIONS

More terms from Zak Seidov, May 31 2006

Edited by njas, Jun 03 2006

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 July 25 07:41 EDT 2008. Contains 142293 sequences.


AT&T Labs Research