Logo

Greetings from The On-Line Encyclopedia of Integer Sequences!

Hints

Search: id:A056738
Displaying 1-1 of 1 results found. page 1
     Format: long | short | internal | text      Sort: relevance | references | number      Highlight: on | off
%I A056738
%S A056738 1,4,8,13,20,28,37,47,59,72,86,101,117,135,154,174,195,217,240,264,290,
%T A056738 317,345,374,404,435,467,500,535,571,608,646,685,725,766,808,851,896,
%U A056738 942,989,1037,1086,1136,1187,1239,1292,1346,1402,1459,1517,1576,1636
%N A056738 Positions where 2's occur in A056731.
%F A056738 A056738(n) = A005228(n)+A030124(n)-n-1.
%F A056738 a(n+1) = a(n) + (n+1) + the number of a(k)'s <= n, 1 <= k <= n and a(1) 
               = 1.
%e A056738 a(9) = a(8) + 8 + the number of a(k)'s <= 8 = 47 + 8 + 1 + 3 ( a(3) is 
               <= 8) = 59.
%t A056738 f[1] = 1; f[n_] := f[n] = Block[ {k = 1}, While[ f[k] < n, k++ ]; Return[ 
               f[n - 1] + n + k ]]; Table[ f[n], {n, 0, 60} ]
%Y A056738 Sequence in context: A130236 A034856 A064609 this_sequence A143978 A071994 
               A023661
%Y A056738 Adjacent sequences: A056735 A056736 A056737 this_sequence A056739 A056740 
               A056741
%K A056738 nonn,easy
%O A056738 1,2
%A A056738 N. J. A. Sloane (njas(AT)research.att.com), Aug 31 2000
%E A056738 More terms from Robert G. Wilson v (rgwv(AT)rgwv.com), Nov 25 2001

    
page 1

Search completed in 0.001 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 November 27 22:38 EST 2009. Contains 167602 sequences.


AT&T Labs Research