Anda di halaman 1dari 5

# 1, 3, 8, 17 - OEIS

14/11/2014

This site is supported by donations to The OEIS Foundation.

Annual Appeal: Today, Nov 11 2014, is the 4th anniversary of the launch of the
new OEIS web site. 70,000 sequences have been added in these four years, all
edited by volunteers. Please make a donation (tax deductible in the US) to help
keep the OEIS running.
Search

1, 3, 8, 17

Hints

## (Greetings from The On-Line Encyclopedia of Integer Sequences!)

Search: seq:1,3,8,17
Displaying 1-10 of 34 results found.
Sort: relevance | references | number | modified | created

page 1 2 3 4
Format: long | short | data

A001580
2^n+n^2.
1, 3, 8, 17, 32, 57, 100, 177, 320, 593, 1124, 2169, 4240, 8361, 16580, 32993, 65792,

+20
23

## 131361, 262468, 524649, 1048976, 2097593, 4194788, 8389137, 16777792, 33555057,

67109540, 134218457, 268436240 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
REFERENCES
G. Everest, A. van der Poorten, I. Shparlinski and T. Ward, Recurrence
Sequences, Amer. Math. Soc., 2003; see esp. p. 255.
P. R. Halmos, Problems for Mathematicians Young and Old. Math. Assoc.
America, 1991, p. 179.
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
Index to sequences with linear recurrences with constant coefficients,
signature (5,-9,7,-2).
FORMULA
G.f.: (2*x-2*x^2+3*x^3-1)/(1-x)^3/(-1+2*x). a(n) =
2*A000217(n+1)+A000079(n) -3*A000027(n+1)+1. - R. J. Mathar, Nov 16 2007
MATHEMATICA
f[n_]:=n^2+2^n; Table[f[n], {n, 0, 5!}] [From Vladimir Joseph Stephan
Orlovsky, Dec 05 2009]
PROG
(MAGMA) [2^n+n^2: n in [0..35]]; // Vincenzo Librandi, Jun 07 2011
(PARI) a(n)=2^n+n^2 \\ Charles R Greathouse IV, Apr 17 2012
(Maxima) A001580(n):=2^n+n^2\$ makelist(A001580(n), n, 0, 20); /* Martin
Ettl, Dec 18 2012 */
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane.
STATUS
approved

A052996
G.f.: (1+x^2-x^3)/((1-x)(1-2*x)).
1, 3, 8, 17, 35, 71, 143, 287, 575, 1151, 2303, 4607, 9215, 18431, 36863, 73727,

+20
9

## 147455, 294911, 589823, 1179647, 2359295, 4718591, 9437183, 18874367, 37748735,

75497471, 150994943, 301989887, 603979775, 1207959551, 2415919103 (list; graph; refs; listen; history;
text; internal format)
OFFSET
0,2
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 1074
Index to sequences with linear recurrences with constant coefficients,
signature (3,-2).
FORMULA
Recurrence: {a(0)=1, -2*a(n)+a(n+1)-1=0, a(3)=17, a(2)=8, a(1)=3}
-1+9/4*2^n
a(n) = 9*2^(n-2) - 1 for n > 1. - Brad Clardy, Sep 23 2011
MAPLE
spec := [S, {S=Prod(Union(Prod(Z, Z), Sequence(Z)), Sequence(Union(Z,
Z)))}, unlabeled ]: seq(combstruct[count ](spec, size=n), n=0..20);
MATHEMATICA
a=8; lst={1, 3, a}; k=9; Do[a+=k; AppendTo[lst, a]; k+=k, {n, 0, 5!}]; lst
[From Vladimir Joseph Stephan Orlovsky, Dec 17 2008]
PROG
(MAGMA) [Floor(9*2^(n-2) - 1): n in [0..40]]; // Vincenzo Librandi, Sep 24
2011
CROSSREFS
Cf. A050524 (primes of this sequence).
https://oeis.org/search?q=1%2C+3%2C+8%2C+17&language=english&go=Search

1/5

1, 3, 8, 17 - OEIS

14/11/2014

KEYWORD
AUTHOR
EXTENSIONS
STATUS

easy,nonn
encyclopedia(AT)pommard.inria.fr, Jan 25 2000
More terms from James A. Sellers, Jun 06 2000
approved

A105163
(n^3 - 7*n + 12)/6.
1, 1 , 3 , 8 , 17 , 31, 51, 78, 113, 157, 211, 276, 353, 443, 547, 666, 801, 953, 1123,

+20
9

1312, 1521, 1751, 2003, 2278, 2577, 2901, 3251, 3628, 4033, 4467, 4931, 5426, 5953,
6513, 7107, 7736, 8401, 9103, 9843, 10622, 11441, 12301, 13203, 14148, 15137, 16171 (list;
graph; refs; listen; history; text; internal format)
OFFSET
1,3
A floretion-generated sequence relating to the sequence "A class of Boolean
functions of n variables and rank 2" (among several others- see link
"Sequences in Context").
a(n) = A181971(n,3) for n > 2. - Reinhard Zumkeller, Jul 09 2012
Table of n, a(n) for n=1..46.
FORMULA
a(n) = A005581(n) + 1
a(n)=C(n+3,n)-n, n>=-1 . - Zerinvary Lajos, Mar 21 2008
Sequence starting (1, 3, 8, 17,...) = binomial transform of [1, 2, 3, 1, 0,
0, 0,...]. - Gary W. Adamson, Apr 24 2008
G.f.: x*(1-3*x+5*x^2-2*x^3)/(1-x)^4. - Colin Barker, Mar 26 2012
MAPLE
seq (binomial(n+3, n)-n, n=-1..44); - Zerinvary Lajos, Mar 21 2008
PROG
Floretion Algebra Multiplication Program, FAMP Code: 2jescycrokseq[ - .25'i
- .25i' - .25'ii' + .25'jj' + .25'kk' + .25'jk' + .25'kj' - .25e]
RokType: Y[15] = Y[15] + p, X[15] = X[15] + 1 (internal program code)
(PARI) a(n)=(n^3-7*n)/6+2 \\ Charles R Greathouse IV, Mar 26 2012
(Maxima) A105163(n):=(n^3 - 7*n + 12)/6\$ makelist(A105163(n), n, 1, 20); /*
Martin Ettl, Dec 18 2012 */
CROSSREFS
Cf. A005581, A102169.
KEYWORD
nonn,easy
AUTHOR
Creighton Dement, Apr 10 2005
STATUS
approved

A046994

## Number of Greek-key tours on a 3 X n board; i.e., self-avoiding walks on a 3 X n grid

starting in the top left corner.
1, 3, 8, 17, 38, 78, 164, 332, 680, 1368, 2768, 5552, 11168, 22368, 44864, 89792,

+20
6

## 179840, 359808, 720128, 1440512, 2882048, 5764608, 11531264, 23063552, 46131200,

92264448, 184537088, 369078272, 738172928, 1476354048 (list; graph; refs; listen; history; text; internal
format)
OFFSET
1,2
REFERENCES
Posting by Thomas Womack (mert0236(AT)sable.ox.ac.uk) to sci.math
newsgroup, Apr 21 1999.
Robert Israel, Table of n, a(n) for n = 1..2985
FORMULA
a(1) = 1; a(2m) = sum_{i = 2...2m-1} a(i) + 3*2^(m-1); a(2m+1) = sum_{i =
2...2m}a(i) + 5*2^(m-1).
a(n) = 11*2^(n-3) - (4 + (-1)^n)*(2^((1/4)*(2n - 7 - (-1)^n))), n >= 2. Nathaniel Johnston, Feb 03 2006
a(n) = 2*a(n-1)+2*a(n-2)-4*a(n-3) for n>4. G.f.: x*(1+x-x^3)/(1-2*x2*x^2+4*x^3). - Colin Barker, Jul 19 2012
EXAMPLE
On a 3 X 3 board labeled 123 456 789 (reading across rows), 125478963 is
such a tour.
MAPLE
A046994:=n->`if`(n=1, 1, 11*2^(n-3)-(4+(-1)^n)*(2^((1/4)*(2*n-7-(-1)^n)))):
seq(A046994(n), n=1..30); # Wesley Ivan Hurt, Sep 14 2014
MATHEMATICA
CoefficientList[Series[(1 + x - x^3)/(1 - 2 x - 2 x^2 + 4 x^3), {x, 0,
30}], x] (* Wesley Ivan Hurt, Sep 14 2014 *)
CROSSREFS
Cf. A046995.
KEYWORD
nonn,walk
AUTHOR
Antreas P. Hatzipolakis (xpolakis(AT)otenet.gr)
EXTENSIONS
More terms and formula from Hugo van der Sanden
STATUS
approved

A130750
Binomial transform of A010882.
1, 3, 8, 17, 33, 64, 127, 255, 512, 1025, 2049, 4096, 8191, 16383, 32768, 65537,

+20
6

## 131073, 262144, 524287, 1048575, 2097152, 4194305, 8388609, 16777216, 33554431,

67108863, 134217728, 268435457, 536870913, 1073741824, 2147483647 (list; graph; refs; listen; history;
text; internal format)
OFFSET
0,2
The first sequence of "less twisted numbers"; this sequence, A130752 and
A130755 form a "suite en trio" (cf. reference, p. 130).
First differences of A130755, second differences of A130752.
Sequence equals its third differences:
1.....3.....8....17....33....64...127...255...512..1025...
...2.....5.....9....16....31....63...128...257...513...
.......3.....4.....7....15....32....65...129...256...
...........1.....3.....8....17....33....64...127...
https://oeis.org/search?q=1%2C+3%2C+8%2C+17&language=english&go=Search

2/5

1, 3, 8, 17 - OEIS

14/11/2014

REFERENCES

FORMULA

PROG

CROSSREFS

KEYWORD
AUTHOR
EXTENSIONS
STATUS

## P. Curtz, Exercise Book, manuscript, 1995.

Table of n, a(n) for n=0..30.
Index to sequences with linear recurrences with constant coefficients,
signature (3,-3,2).
G.f.: (1+2*x^2)/((1-2*x)*(1-x+x^2)).
a(0) = 1; a(1) = 3; a(2) = 8; for n > 2, a(n) = 3*a(n-1) - 3*a(n-2) +
2*a(n-3).
a(n) = 2^(n+1) + A128834(n+4).
a(0) = 1; for n > 0, a(n) = 2*a(n-1) + A057079(n-1).
(MAGMA) m:=31; S:=[ [1, 2, 3][(n-1) mod 3 +1]: n in [1..m] ]; [ &+[
Binomial(i-1, k-1)*S[k]: k in [1..i] ]: i in [1..m] ]; /* Klaus
Brockhaus, Aug 03 2007 */
(PARI) {m=31; v=vector(m); v[1]=1; v[2]=3; v[3]=8; for(n=4, m, v[n]=3*v[n1]-3*v[n-2]+2*v[n-3]); v} /* Klaus Brockhaus, Aug 03 2007 */
(PARI) {for(n=0, 30, print1(2^(n+1)+[ -1, -1, 0, 1, 1, 0][n%6+1], ", "))}
/* Klaus Brockhaus, Aug 03 2007 */
Cf. A010882 (periodic (1, 2, 3)), A128834 (periodic (0, 1, 1, 0, -1, -1)),
A057079 (periodic (1, 2, 1, -1, -2, -1)), A130752 (first differences),
A130755 (second differences).
nonn,easy
Paul Curtz, Jul 13 2007
Edited and extended by Klaus Brockhaus, Aug 03 2007
approved

A(n,k) for n >= k in triangular ordering, where A(n,k) is the number of compositions (ordered +205
partitions) of n into k parts, with the first part greater than or equal to all other parts.
1, 1, 2, 1, 2, 4, 1, 3, 6, 11, 1 , 3 , 8 , 17 , 32, 1, 4, 11, 26, 54, 102, 1, 4, 13, 35,

A156042

82, 172, 331, 1, 5, 17, 48, 120, 272, 567, 1101, 1, 5, 20, 63, 170, 412, 918, 1906,
3724, 1, 6, 24, 81, 235, 607, 1434, 3152, 6518, 12782, 1, 6, 28, 102, 317, 872, 2180,
5049, 10978, 22616, 44444 (list; table; graph; refs; listen; history; text; internal format)
OFFSET
1,3
The value is smaller than the number of compositions (ordered partitions)
of n into k parts and at least the number of (unordered) partitions.
Alois P. Heinz, Rows n = 1..100, flattened
EXAMPLE
A(5,3) = 8 and the 8 compositions of 5 into 3 parts with first part maximal
are:
[5,0,0], [4,1,0], [4,0,1], [3,2,0], [3,0,2], [3,1,1], [2,2,1], [2,1,2].
1
1 2
1 2 4
1 3 6 11
1 3 8 17 32
1 4 11 26 54 102
MAPLE
b:= proc(n, i, m) option remember; if n<0 then 0 elif n=0 then 1 elif i=1
then `if` (n<=m, 1, 0) else add (b(n-k, i-1, m), k=0..m) fi end: A:= (n,
k)-> add (b(n-m, k-1, m), m=ceil(n/k)..n): seq (seq (A(n, k), k=1..n),
n=1..12); # Alois P. Heinz, Jun 14 2009
MATHEMATICA
nn=10; Table[Table[Coefficient[Series[Sum[x^i((1-x^(i+1))/(1-x))^(k-1), {i,
0, n}], {x, 0, nn}], x^n], {k, 1, n}], {n, 1, nn}]//Grid (* Geoffrey
Critzer, Jul 15 2013 *)
CROSSREFS
A156041 is the whole of the square. A156043 is the diagonal. See also
A156039 and A156040.
KEYWORD
nonn,tabl
AUTHOR
Jack W Grahl, Feb 02 2009
EXTENSIONS
More terms from Alois P. Heinz, Jun 14 2009
STATUS
approved

A182734
Number of parts in all partitions of 2n that do not contain 1 as a part.
0, 1 , 3 , 8 , 17 , 34, 68, 123, 219, 382, 642, 1055, 1713, 2713, 4241, 6545, 9950, 14953,

+20
5

22255, 32752, 47774, 69104, 99114, 141094, 199489, 280096, 390836, 542170, 747793,
1025912, 1400425, 1902267, 2572095, 3462556, 4641516, 6196830, 8241460, 10919755,
14416885 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,3
Essentially this is a bisection (even part) of A138135.
Alois P. Heinz, Table of n, a(n) for n = 0..1000
MAPLE
b:= proc(n, i) option remember; local p, q;
if n<0 then [0, 0]
elif n=0 then [1, 0]
elif i=1 then [0, 0]
else p, q:= b(n, i-1), b(n-i, i);
[p[1]+q[1], p[2]+q[2]+q[1]]
fi
end:
a:= n-> b(2*n, 2*n)[2]:
seq (a(n), n=0..35); # Alois P. Heinz, Dec 03 2010
MATHEMATICA
Table[Length[Flatten[DeleteCases[IntegerPartitions[2n], _?(MemberQ[ #,
1]&)]]], {n, 0, 40}] (* Harvey P. Dale, Aug 08 2013 *)
https://oeis.org/search?q=1%2C+3%2C+8%2C+17&language=english&go=Search

3/5

1, 3, 8, 17 - OEIS

14/11/2014

CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
STATUS

A002625

## Cf. A135010, A138121, A138135, A182742.

nonn
Omar E. Pol, Dec 03 2010
More terms from Alois P. Heinz, Dec 03 2010
approved

Expansion of 1/((1-x)^3*(1-x^2)^2*(1-x^3)).

## (Formerly M2726 N1093)

1, 3, 8, 17, 33, 58, 97, 153, 233, 342, 489, 681, 930, 1245, 1641, 2130, 2730, 3456,
4330, 5370, 6602, 8048, 9738, 11698, 13963, 16563, 19538, 22923, 26763, 31098, 35979,
41451, 47571, 54390, 61971, 70371, 79660, 89901, 101171, 113540, 127092, 141904, 158068,
175668, 194804, 215568 (list; graph; refs; listen; history; text; internal format)
OFFSET
0,2
Number of (integer) partitions of n into 3 sorts of 1's, 2 sorts of 2's,
and 1 sort of 3's. - Joerg Arndt, May 17 2013
REFERENCES
N. J. A. Sloane, A Handbook of Integer Sequences, Academic Press, 1973
(includes this sequence).
N. J. A. Sloane and Simon Plouffe, The Encyclopedia of Integer Sequences,
Academic Press, 1995 (includes this sequence).
Vincenzo Librandi, Table of n, a(n) for n = 0..1000
E. Fix and J. L. Hodges, Jr., Significance probabilities of the Wilcoxon
test, Annals Math. Stat., 26 (1955), 301-312.
INRIA Algorithms Project, Encyclopedia of Combinatorial Structures 205
Gerzson Keri and Patric R. J. Ostergard, The Number of Inequivalent
(2R+3,7)R Optimal Covering Codes, Journal of Integer Sequences, Vol. 9
(2006), Article 06.4.7.
Simon Plouffe, Approximations de sries gnratrices et quelques
conjectures, Dissertation, Universit du Qubec Montral, 1992.
Simon Plouffe, 1031 Generating Functions and Conjectures, Universit du
Qubec Montral, 1992.
FORMULA
a(n) = floor((n+1)*(135*(-1)^n + 6*n^4 + 144*n^3 + 1256*n^2 + 4744*n +
6785)/8640+1/2). - Tani Akinari, Oct 07 2012
MAPLE
A002625:=1/(z**2+z+1)/(z+1)**2/(z-1)**6; [Simon Plouffe in his 1992
dissertation.]
MATHEMATICA
CoefficientList[Series[1/((1-x)^3*(1-x^2)^2*(1-x^3)), {x, 0, 50}], x] (*
Vincenzo Librandi, Feb 25 2012 *)
PROG
(PARI) Vec(1/(1-x)^3/(1-x^2)^2/(1-x^3)+O(x^99)) \\ Charles R Greathouse IV,
Apr 30 2012
CROSSREFS
Partial sums of A097701.
KEYWORD
nonn,easy
AUTHOR
N. J. A. Sloane
STATUS
approved

A027181
Lucas(n+4) - (2n+6).
1, 3, 8, 17, 33, 60, 105, 179, 300, 497, 817, 1336, 2177, 3539, 5744, 9313, 15089,

+20
4

+20
3

24436, 39561, 64035, 103636, 167713, 271393, 439152, 710593, 1149795, 1860440, 3010289,
4870785, 7881132, 12751977, 20633171, 33385212, 54018449, 87403729, 141422248 (list; graph;
refs; listen; history; text; internal format)
OFFSET
0,2
Table of n, a(n) for n=0..35.
FORMULA
a(n) = Sum{T(n-k, k)}, 0<=k<=[ n/2 ], T given by A027170.
G.f.: (1+x^2)/[(1-x)^2*(1-x-x^2)].
MATHEMATICA
LinearRecurrence[{3, -2, -1, 1}, {1, 3, 8, 17}, 50] (* Vladimir Joseph
Stephan Orlovsky, Jan 25 2012 *)
PROG
(MAGMA) [Lucas(n+4) - (2*n+6): n in [0..100]]; // Vincenzo Librandi, Apr 16
2011
KEYWORD
nonn
AUTHOR
Clark Kimberling
STATUS
approved
+20
Number of terms on the n-th level of the Inverse-Totient-Tree (ITT). The 0th, first, 2nd and
3
3rd levels are {1}, {2}, {3, 4, 6}, {5, 7, 8, 9, 10, 12, 14, 18} with 1, 1, 3, 8 entries resp. The
(n+1)-st level is obtained from the n-th level as the union of the inverse phi sets of the terms
occurring earlier on the n-th level.
1, 1 , 3 , 8 , 17 , 41, 92, 215, 487, 1126, 2583, 5981, 13698, 31647, 72678, 167474, 385021

A058811

## (list; graph; refs; listen; history; text; internal format)

OFFSET
0,3
The 3rd level is {5, 8, 10, 12, 7, 9, 14, 18} and a(3)=8. Generate
invphi(5)={}, .., invphi(12)={13, 21, 26, 28, 36, 42}, ...,
invphi(14)={}, .. The union of these inverses gives the 4th Floor ={15,
16, 20, 24, 30, 11, 22, 13, 21, 26, 28, 36, 42, 19, 27, 38, 54}, which
has 17 terms. So a(4)=17. Each level-set may have entries either from
A007617, A005278 (initial nodes of the tree) or from A000010 (invphicontinuable numbers)
Results of Shapiro show that largest number in the n-th level is 2*3^(n-1).
The Mathematica code first computes A003434(k) for k <= 2*3^(n-1); then
https://oeis.org/search?q=1%2C+3%2C+8%2C+17&language=english&go=Search

4/5

1, 3, 8, 17 - OEIS

14/11/2014

REFERENCES
FORMULA

MATHEMATICA

CROSSREFS
KEYWORD
AUTHOR
EXTENSIONS
STATUS

## it gives the number of numbers k for which A003434(k) = n. - T. D. Noe,

Mar 08 2004
Harold Shapiro, An arithmetic function arising from the phi function, Amer.
Math. Monthly, Vol. 50, No. 1 (1943), 18-30.
Table of n, a(n) for n=0..16.
a(n)=Cardinality[Floor(n)], where Floor(0)={1},
Floor(n+1)=Union[invphi(t(i, n)), i=1..a(n))], where t(i, n) is the i-th
integer in Floor(n), ordered by size or lexicographically.
Table[ Length[ Select[ Range[ 1, 1050000 ], Equal[ flo[ # ], k ]& ] ], {k,
1, 20} ], where flo[ x_ ] := Length[ Delete[ FixedPointList[ EulerPhi, x
], -1 ] ]
nMax=16; kMax=2*3^(nMax-1); a=Table[0, {kMax}]; Do[e=EulerPhi[k];
a[[k]]=1+a[[e]], {k, 2, kMax}]; Table[Count[a, _?(#==n &)], {n, 0, nMax}]
A000010, A007617, A005278.
Cf. A003434 (iterations of phi(n) needed to reach 1).
nonn
Labos Elemer, Jan 03 2001
More terms from T. D. Noe, Mar 08 2004
approved
page 1 2 3 4
Search completed in 2.220 seconds

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Transforms | Superseeker | Recent | More pages
The OEIS Community | Maintained by The OEIS Foundation Inc.
Content is available under The OEIS End-User License Agreement .
Last modified November 14 03:52 EST 2014. Contains 249388 sequences.

https://oeis.org/search?q=1%2C+3%2C+8%2C+17&language=english&go=Search

5/5