Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A017329
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A017329
%S A017329 5,15,25,35,45,55,65,75,85,95,105,115,125,135,145,155,165,
%T A017329 175,185,195,205,215,225,235,245,255,265,275,285,295,305,
%U A017329 315,325,335,345,355,365,375,385,395,405,415,425,435,445
%N A017329 10n+5.
%C A017329 Continued fraction expansion of tanh(1/5). - Benoit Cloitre (benoit7848c(AT)orange.fr), 
               Dec 17 2002
%C A017329 n such that 5 divides the numerator of B(2n) where B(2n) = the 2n-th 
               Bernoulli number. - Benoit Cloitre (benoit7848c(AT)orange.fr), Jan 
               01 2004
%C A017329 5 times odd numbers. - Omar E. Pol (info(AT)polprimos.com), May 02 2008
%C A017329 5th transversal numbers (or 5-transversal numbers): Numbers of the 5th 
               column of positive numbers in the square array of nonnegative and 
               polygonal numbers A139600. Also, numbers of the 5th column in the 
               square array A057145. - Omar E. Pol (info(AT)polprimos.com), May 
               02 2008
%C A017329 Except for the first term, a(n)=20*n-a(n-1), (with a(1)=15) [From Vincenzo 
               Librandi (vincenzo.librandi(AT)tin.it), Oct 23 2009]
%H A017329 Tanya Khovanova, <a href="http://www.tanyakhovanova.com/RecursiveSequences/
               RecursiveSequences.html">Recursive Sequences</a>
%F A017329 a(n) = (A000217(5)-5)*n+5 = (15-5)n+5 = 10n+5 = 5(2n+1). - Omar E. Pol 
               (info(AT)polprimos.com), May 02 2008
%F A017329 a(n) = A005408(n)*5. [From Omar E. Pol (info(AT)polprimos.com), Oct 19 
               2008]
%e A017329 For n=2, a(2)=20*2-15=25; n=3, a(3)=20*3-25=35; n=4, a(4)=20*4-35=45 
               [From Vincenzo Librandi (vincenzo.librandi(AT)tin.it), Oct 23 2009]
%o A017329 (Other) sage: [i for i in range(450) if gcd(i,20) == 5] # [From Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
%o A017329 (Other) sage: [i+5 for i in range(446) if gcd(i,10) == 10] # [From Zerinvary 
               Lajos (zerinvarylajos(AT)yahoo.com), May 20 2009]
%Y A017329 Cf. A000367.
%Y A017329 Cf. A016957, A057145, A139600, A139606.
%Y A017329 Subsequence of A034709, together with A017281, A017293, A139222, A139245, 
               A139249, A139264, A139279 and A139280.
%Y A017329 Cf. A005408. [From Omar E. Pol (info(AT)polprimos.com), Oct 19 2008]
%Y A017329 Sequence in context: A043509 A121025 A031322 this_sequence A068528 A061443 
               A147495
%Y A017329 Adjacent sequences: A017326 A017327 A017328 this_sequence A017330 A017331 
               A017332
%K A017329 nonn,easy
%O A017329 0,1
%A A017329 N. J. A. Sloane (njas(AT)research.att.com).

    
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 December 3 22:15 EST 2009. Contains 170310 sequences.


AT&T Labs Research