A182280 -id:A182280 - cp's OEIS frontend

A064650 a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.

1, 2, 2, 3, 3, 4, 5, 6, 8, 10, 13, 16, 21, 26, 34, 43, 55, 70, 90, 115, 147, 188, 241, 308, 395, 505, 647, 828, 1061, 1358, 1740, 2228, 2854, 3655, 4681, 5995, 7678, 9834, 12595, 16131, 20660, 26461, 33890, 43406, 55593, 71202, 91194, 116799, 149593, 191595

Offset: 0

Henry Bottomley, Oct 04 2001

nonn

a(n)/a(n-1) tends to (1+sqrt(17))/4 = 1.2807764...

Harry J. Smith and Reinhard Zumkeller, Table of n, a(n) for n = 0..9300, first 401 terms from Harry J. Smith

Cf. A064324, A064325, A182280, A182281.

Cf. A064651, A000045.

a064650 n = a064650_list !! n
a064650_list = 1 : 2 : zipWith (+)
                       a064650_list (map (flip div 2) $ tail a064650_list)
-- Reinhard Zumkeller, Apr 30 2015

[n le 2 select n else Floor(Self(n-1)/2)+Self(n-2): n in [1..50]]; // Bruno Berselli, Apr 21 2012

RecurrenceTable[{a[0] == 1, a[1] == 2, a[n] == Floor[a[n - 1]/4] + a[n - 2]}, a, {n, 49}] (* Bruno Berselli, Apr 21 2012 *)

{ for (n=0, 400, if (n>1, a=a1\2 + a2; a2=a1; a1=a, if (n, a=a1=2, a=a2=1)); write("b064650.txt", n, " ", a) ) } \\ Harry J. Smith, Sep 21 2009

a(n) = A064651(n) + 1.

A182230 a(n) = a(n-1)+floor(a(n-2)/4) with a(0)=3, a(1)=4.

Original entry on oeis.org

3, 4, 4, 5, 6, 7, 8, 9, 11, 13, 15, 18, 21, 25, 30, 36, 43, 52, 62, 75, 90, 108, 130, 157, 189, 228, 275, 332, 400, 483, 583, 703, 848, 1023, 1235, 1490, 1798, 2170, 2619, 3161, 3815, 4605, 5558, 6709, 8098, 9775, 11799, 14242, 17191, 20751, 25048, 30235

Offset: 0

Alex Ratushnyak, Apr 19 2012

nonn

a(n)/a(n-1) tends to (1+sqrt(2))/2 = 1.207106781186547524... [Bruno Berselli, Apr 23 2012]

Bruno Berselli, Table of n, a(n) for n = 0..1000

Cf. A064323, A064324, A182229, A182280; A174968.

a182230 n = a182230_list !! n
a182230_list = 3 : 4 : zipWith (+)
                       (map (flip div 4) a182230_list) (tail a182230_list)
-- Reinhard Zumkeller, Apr 30 2015

[n le 2 select n+2 else Self(n-1)+Floor(Self(n-2)/4): n in [1..52]]; // Bruno Berselli, Apr 20 2012

a:= proc(n) a(n):= a(n-1) +floor(a(n-2)/4) end: a(0), a(1):= 3, 4:
seq(a(n), n=0..60);  # Alois P. Heinz, Apr 20 2012

RecurrenceTable[{a[0] == 3, a[1] == 4, a[n] == a[n - 1] + Floor[a[n - 2]/4]}, a, {n, 51}] (* Bruno Berselli, Apr 21 2012 *)

prpr = 3
prev = 4
for i in range(2,55):
    current = prev + prpr//4
    print(current, end=',')
    prpr = prev
    prev = current

A182281 a(n) = floor(a(n-1)/3)+a(n-2) with a(0)=2, a(1)=3.

Original entry on oeis.org

2, 3, 3, 4, 4, 5, 5, 6, 7, 8, 9, 11, 12, 15, 17, 20, 23, 27, 32, 37, 44, 51, 61, 71, 84, 99, 117, 138, 163, 192, 227, 267, 316, 372, 440, 518, 612, 722, 852, 1006, 1187, 1401, 1654, 1952, 2304, 2720, 3210, 3790, 4473, 5281, 6233, 7358, 8685, 10253, 12102

Offset: 0

Bruno Berselli, Apr 21 2012

nonn

a(n)/a(n-1) tends to (1+sqrt(37))/6 = 1.180460421716369948...

Bruno Berselli, Table of n, a(n) for n = 0..1000

Cf. A064650, A182229, A182280; A188935.

a182281 n = a182281_list !! n
a182281_list = 2 : 3 : zipWith (+)
                       a182281_list (map (flip div 3) $ tail a182281_list)
-- Reinhard Zumkeller, Apr 30 2015

[n le 2 select n+1 else Floor(Self(n-1)/3)+Self(n-2): n in [1..55]];

RecurrenceTable[{a[0] == 2, a[1] == 3, a[n] == Floor[a[n - 1]/3] + a[n - 2]}, a, {n, 54}]
Transpose[NestList[{#[[2]],Floor[#[[2]]/3]+#[[1]]}&,{2,3},60]][[1]] (* Harvey P. Dale, Nov 26 2015 *)

cp's OEIS Frontend

A064650 a(n) = floor(a(n-1)/2) + a(n-2) with a(0)=1, a(1)=2.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica

PARI

Formula

A182230 a(n) = a(n-1)+floor(a(n-2)/4) with a(0)=3, a(1)=4.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Maple

Mathematica

Python

A182281 a(n) = floor(a(n-1)/3)+a(n-2) with a(0)=2, a(1)=3.

Views

Author

Keywords

Comments

Links

Crossrefs

Programs

Haskell

Magma

Mathematica